Comparative study of distance-based graph invariants
From MaRDI portal
Publication:2053092
DOI10.1007/s12190-020-01363-2zbMath1475.05044OpenAlexW3027043837MaRDI QIDQ2053092
Hongzhuan Wang, Maolin Wang, Hong-Bo Hua
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01363-2
treeconnected graphreciprocal degree distanceeccentric connectivity indexaverage distanceadjacent eccentric distance sum
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- 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
- Comparison between the zeroth-order Randić index and the sum-connectivity index
- Relations between distance-based and degree-based topological indices
- Average distance and domination number
- Coupling deep correlation filter and online discriminative learning for visual object tracking
- Inequalities between degree- and distance-based graph invariants
- On the adjacent eccentric distance sum of graphs
- Comparing eccentricity-based graph invariants
- Comparison between the Szeged index and the eccentric connectivity index
- Proximity and remoteness in graphs: Results and conjectures
- Average distance, minimum degree, and spanning trees
- Relationships between some distance-based topological indices
- Wiener index of trees: Theory and applications
- Further results on the reciprocal degree distance of graphs
This page was built for publication: Comparative study of distance-based graph invariants