Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2015.09.004 | Discrete Applied Mathematics |
Keywords | Field | DocType |
connectivity | Discrete mathematics,Inverse,Combinatorics,Bound graph,Vertex (geometry),Chromatic scale,Upper and lower bounds,Algebraic connectivity,Degree (graph theory),Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
203 | C | 0166-218X |
Citations | PageRank | References |
3 | 0.48 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kexiang Xu | 1 | 72 | 11.43 |
| Kinkar Ch. Das | 2 | 208 | 30.32 |