Further results on the reciprocal degree distance of graphs
From MaRDI portal
Publication:5963642
DOI10.1007/s10878-014-9780-7zbMath1331.05114MaRDI QIDQ5963642
Minjie Zhang, Huihui Zhang, Shuchao Li
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9780-7
bipartite graph; diameter; matching number; planar graph; reciprocal degree distance; vertex-connectivity
Related Items
Harary index of bipartite graphs, Unnamed Item, Comparative study of distance-based graph invariants, General degree distance of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- On the reciprocal degree distance of graphs
- Some results on the reciprocal sum-degree distance of graphs
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- On the distance spectral radius of bipartite graphs
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Trees with the seven smallest and eight greatest Harary indices
- On the extremal Zagreb indices of graphs with cut edges
- Additively weighted Harary index of some composite graphs
- On the sum of all distances in bipartite graphs
- On bags and bugs
- Note on vertex degrees of planar graphs
- Wiener index of trees: Theory and applications
