Wiener odd and even indices on BC-Trees

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86097033" target="_blank" >RIV/61989100:27240/15:86097033 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/WICT.2013.7113136" target="_blank" >http://dx.doi.org/10.1109/WICT.2013.7113136</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/WICT.2013.7113136" target="_blank" >10.1109/WICT.2013.7113136</a>

Result language
angličtina
Original language name
Wiener odd and even indices on BC-Trees
Original language description
Corresponding to the concepts of Wiener index and distance of the vertex, in this paper, we present the concepts of Wiener odd (even) index of G as sum of the distances between all pairs of vertices of G satisfying the distances are all odd (even) and denote them Wodd(G) and Wodd(G) respectively. Based on the concepts of the two indices, we prove theoretically that Wiener odd index is not more than its even index for general BC-Trees. Closed formulae of the two indices are also provided for path BC-tree, star, k-extending star tree and caterpillar BC-tree. Meanwhile, the extreme values of Wodd(T) of n vertices BC-trees are characterized as well. (C) 2013 IEEE.
Czech name
—
Czech description
—

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2013 3rd World Congress on Information and Communication Technologies, WICT 2013
ISBN
978-1-4799-3230-6
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
208-213
Publisher name
Institute of Electrical and Electronics Engineers
Place of publication
New York
Event location
Hanoi
Event date
Dec 15, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)