Reciprocal degree distance and graph properties
From MaRDI portal
Publication:1732091
DOI10.1016/j.dam.2018.11.012zbMath1415.05041OpenAlexW2905147028WikidataQ128700070 ScholiaQ128700070MaRDI QIDQ1732091
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.012
Related Items (2)
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the reciprocal degree distance of graphs
- Reciprocal degree distance of product graphs
- Best monotone degree conditions for graph properties: a survey
- Degree distance of unicyclic and bicyclic graphs
- Calculating the edge Wiener and edge Szeged indices of graphs
- Ordering connected graphs having small degree distances
- Additively weighted Harary index of some composite graphs
- Wiener index, Harary index and graph properties
- Weighted Harary indices of apex trees and \(k\)-apex trees
- On the reformulated reciprocal sum-degree distance of graph transformations
- WIENER INDEX AND TRACEABLE GRAPHS
- WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS
- Reducibility among Combinatorial Problems
- Wiener index of trees: Theory and applications
This page was built for publication: Reciprocal degree distance and graph properties