论文信息 - Some extremal graphs with respect to inverse degree

Some extremal graphs with respect to inverse degree

The inverse degree of graph G is defined as I D ( G ) = ? v ? V ( G ) 1 d G ( v ) where d G ( v ) is the degree of vertex v in G . In this paper we have determined some upper and lower bounds on the inverse degree I D ( G ) for a connected graph G in terms of other graph parameters, such as chromatic number, clique number, connectivity, number of cut edges, matching number. Also the corresponding extremal graphs have been completely characterized.

Kinkar Chandra Das | Kexiang Xu | Kexiang Xu | K. Das

[1] Siemion Fajtlowicz,et al. On conjectures of Graffiti , 1988, Discret. Math..

[2] Xueliang Li,et al. Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index , 2007, Discret. Appl. Math..

[3] Kexiang Xu,et al. On Zagreb and Harary Indices , 2013 .

[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[5] Peter Dankelmann,et al. Diameter and inverse degree , 2008, Discret. Math..

[6] Shinya Fujita,et al. On diameter and inverse degree of chemical graphs , 2013 .

[7] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[8] Simon Mukwembi,et al. On diameter and inverse degree of a graph , 2010, Discret. Math..

[9] Zhongfu Zhang,et al. The relation of matching with inverse degree of a graph , 2005, Discret. Math..

[10] K. C. Das,et al. On Inverse degree and topological indices of graphs , 2016 .

[11] J. Spencer,et al. On the mean distance between points of a graph , 1988 .

[12] P. Dankelmann,et al. Inverse degree and edge-connectivity , 2009, Discret. Math..

[13] Xueliang Li,et al. On the diameter and inverse degree , 2011, Ars Comb..