Back to Search
Start Over
Some extremal graphs with respect to inverse degree.
- Source :
-
Discrete Applied Mathematics . Apr2016, Vol. 203, p171-183. 13p. - Publication Year :
- 2016
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 203
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 113867805
- Full Text :
- https://doi.org/10.1016/j.dam.2015.09.004