On eccentric distance sum and degree distance of graphs
From MaRDI portal
Publication:1801067
DOI10.1016/J.DAM.2018.04.011zbMATH Open1398.05075OpenAlexW2801798868WikidataQ129865274 ScholiaQ129865274MaRDI QIDQ1801067FDOQ1801067
Authors: Hongzhuan Wang, Xiaolan Hu, Hongbo Hua
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.04.011
Recommendations
Cites Work
- The minimum degree distance of graphs of given order and size
- Properties of connected graphs having minimum degree distance
- Some extremal properties of the degree distance of a graph
- Extremal values on the eccentric distance sum of trees
- Unicyclic and bicyclic graphs having minimum degree distance
- Graph theory with applications
- Degree distance of unicyclic and bicyclic graphs
- The eccentric connectivity index of nanotubes and nanotori
- Wiener index of trees: Theory and applications
- On the degree distance of a graph
- Computing the eccentric-distance sum for graph operations
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- On the extreme eccentric distance sum of graphs with some given parameters
- On eccentric distance sum and minimum degree
- On the eccentric connectivity index of a graph
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- Proof of conjectures on remoteness and proximity in graphs
- Proximity and remoteness in graphs: results and conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- The difference between remoteness and radius of a graph
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Eccentric Connectivity Index of Chemical Trees
- The average distance and the independence number
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- Degree distance of unicyclic graphs
- Ordering connected graphs having small degree distances
- The relationship between the eccentric connectivity index and Zagreb indices
- Spanning trees with many leaves and average distance
- The eccentric distance sum of connected graphs
Cited In (24)
- Relations between degree-based graph invariants
- Some results on the reciprocal sum-degree distance of graphs
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- General degree distance of graphs
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- The eccentric-distance sum of some graphs
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs
- On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
- Extremal graphs with respect to two distance-based topological indices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS
- Some sufficient conditions for graphs to be \(k\)-leaf-connected
- Title not available (Why is that?)
- On the relation between degree distance and eccentric connectivity index
- Comparative results and bounds for the eccentric-adjacency index
- Further results on the Merrifield-Simmons index
- Some further results on the eccentric distance sum
- Title not available (Why is that?)
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- The minimum eccentric distance sum of trees with given distance \(k\)-domination number
- Gutman index -- a critical personal account
- On extremal bipartite graphs with given number of cut edges
Uses Software
This page was built for publication: On eccentric distance sum and degree distance of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801067)