Reciprocal degree distance and graph properties
From MaRDI portal
Publication:1732091
DOI10.1016/J.DAM.2018.11.012zbMATH Open1415.05041OpenAlexW2905147028WikidataQ128700070 ScholiaQ128700070MaRDI QIDQ1732091FDOQ1732091
Authors: Xianqiang Yang
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
Recommendations
Cites Work
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Additively weighted Harary index of some composite graphs
- Wiener index and traceable graphs
- Graph theory with applications
- Title not available (Why is that?)
- On the reciprocal degree distance of graphs
- Degree distance of unicyclic and bicyclic graphs
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Title not available (Why is that?)
- Calculating the edge Wiener and edge Szeged indices of graphs
- On the reformulated reciprocal sum-degree distance of graph transformations
- Reciprocal degree distance of product graphs
- Best monotone degree conditions for graph properties: a survey
- Ordering connected graphs having small degree distances
- Title not available (Why is that?)
- Weighted Harary indices of apex trees and \(k\)-apex trees
- Wiener index, Harary index and graph properties
- Wiener index on traceable and Hamiltonian graphs
- Some observations on Harary index and traceable graphs
Cited In (13)
- Reciprocal degree distance and Hamiltonian properties of graphs
- Title not available (Why is that?)
- Reciprocal degree distance of Grassmann graphs
- On the reciprocal degree distance of graphs with cut vertices or cut edges.
- On the reciprocal degree distance of graphs
- Reciprocal degree distance of some derived graphs
- A note on Steiner reciprocal degree distance
- The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- Title not available (Why is that?)
- Sufficient conditions for a graph to be \(k\)-edge-Hamiltonian, \(k\)-path-coverable, traceable and Hamilton-connected
- Sufficient conditions for \(k\)-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
- Further results on the reciprocal degree distance of graphs
This page was built for publication: Reciprocal degree distance and graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732091)