Title
Higher order connectivity index of starlike trees
Abstract
We show that for every integer h ≥ 0, the higher order connectivity index hχ(T) of a starlike tree T (a tree with unique vertex of degree 2) is completely determined by its branches of length ≤ h. As a consequence, we show that starlike trees which have equal h-connectivity index for all h ≥ 0 are isomorphic.
Year
DOI
Venue
2002
10.1016/S0166-218X(01)00232-3
Discrete Applied Mathematics
Keywords
Field
DocType
unique vertex,integer h,higher order connectivity index,starlike tree,equal h-connectivity index,higher order,indexation
Graph theory,Integer,Discrete mathematics,Social connectedness,Combinatorics,Tree (graph theory),Vertex (geometry),Star (graph theory),Isomorphism,Mathematics,Topological index
Journal
Volume
Issue
ISSN
119
3
Discrete Applied Mathematics
Citations 
PageRank 
References 
7
0.77
3
Authors
2
Name
Order
Citations
PageRank
Juan Rada13610.02
Oswaldo Araujo2133.11