Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
From MaRDI portal
Publication:498422
DOI10.1007/s10878-013-9649-1zbMath1327.05092OpenAlexW2117701440MaRDI QIDQ498422
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9649-1
Related Items (15)
On the maximal connective eccentricity index of bipartite graphs with some given parameters ⋮ On connected graphs having the maximum connective eccentricity index ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Maximum reciprocal degree resistance distance index of unicyclic graphs ⋮ On multiplicative sum Zagreb index of trees with fixed domination number ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ On extremal Zagreb indices of trees with given domination number ⋮ On topological indices of graph transformation ⋮ Further results on the reciprocal degree distance of graphs ⋮ Maximum reciprocal degree resistance distance index of bicyclic graphs ⋮ Comparative study of distance-based graph invariants ⋮ Unnamed Item ⋮ On Sombor index of trees with fixed domination number
Cites Work
- Unnamed Item
- Unnamed Item
- On the reciprocal degree distance of graphs
- The eccentric connectivity index of nanotubes and nanotori
- Trees with the seven smallest and eight greatest Harary indices
- Trees with minimal Laplacian coefficients
- Comparison of graphs by their number of spanning trees
- Additively weighted Harary index of some composite graphs
- Walks and paths in trees
- Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications
- Wiener index of trees: Theory and applications
This page was built for publication: Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
