Trees of extremal connectivity index

@article{Liu2006TreesOE,
  title={Trees of extremal connectivity index},
  author={Huiqing Liu and Mei Lu and Feng Tian},
  journal={Discrete Applied Mathematics},
  year={2006},
  volume={154},
  pages={106-119}
}
The connectivity index w (G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T ). Also, for −1 < 0, we give a sharp lower bound and a upper bound for w (T ). © 2005 Elsevier B.V. All rights reserved. 
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

P

  • G. Caporossi
  • Hansen,Variable neighborhood search for extremal…
  • 2004
1 Excerpt

Sharp bounds for the general Randić index

  • X. Li, Y.Yang
  • MATCH Comm. Math. Comput. Chem
  • 2004
1 Excerpt

Sharp bounds for the general Randić index , MATCHComm

  • Y. Yang
  • Math . Comput . Chem .
  • 2004

Trees with small Randić connectivity indices

  • H. Zhao, X. Li
  • MATCH Comm. Math. Comput. Chem. 51
  • 2004
1 Excerpt

Trees with the first three smallest and largest generalized topological indices

  • X. Li, H. Zhao
  • MATCH Comm. Math. Comput. Chem. 50
  • 2004
1 Excerpt

Trees with the first three smallest and largest generalized topological indices , MATCHComm

  • H. Zhao
  • Math . Comput . Chem .
  • 2004

Alkane ordering as a criterion for similarity between topological indices: index J as a “sharpened Wiener index

  • A. T. Balaban, D. Mills, S. Basak
  • MATCH Comm. Math. Comput. Chem. 45
  • 2002

Similar Papers

Loading similar papers…