On eccentric distance sum and degree distance of graphs
From MaRDI portal
(Redirected from Publication:1801067)
Recommendations
Cites work
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Computing the eccentric-distance sum for graph operations
- Degree distance of unicyclic and bicyclic graphs
- Degree distance of unicyclic graphs
- Eccentric Connectivity Index of Chemical Trees
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Extremal values on the eccentric distance sum of trees
- Further results on the eccentric distance sum
- Graph theory with applications
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- On eccentric distance sum and minimum degree
- On the degree distance of a graph
- 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
- On the extreme eccentric distance sum of graphs with some given parameters
- Ordering connected graphs having small degree distances
- Proof of conjectures on remoteness and proximity in graphs
- Properties of connected graphs having minimum degree distance
- Proximity and remoteness in graphs: results and conjectures
- Some extremal properties of the degree distance of a graph
- Spanning trees with many leaves and average distance
- The average distance and the independence number
- The difference between remoteness and radius of a graph
- The eccentric connectivity index of nanotubes and nanotori
- The eccentric distance sum of connected graphs
- The minimum degree distance of graphs of given order and size
- The relationship between the eccentric connectivity index and Zagreb indices
- Unicyclic and bicyclic graphs having minimum degree distance
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Wiener index of trees: Theory and applications
Cited in
(24)- On extremal bipartite graphs with given number of cut edges
- Some results on the reciprocal sum-degree distance of graphs
- Relations between degree-based graph invariants
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- General degree distance of 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
- scientific article; zbMATH DE number 687700 (Why is no real title available?)
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- scientific article; zbMATH DE number 7653613 (Why is no real title available?)
- ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS
- Some sufficient conditions for graphs to be \(k\)-leaf-connected
- scientific article; zbMATH DE number 7478529 (Why is no real title available?)
- 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
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- scientific article; zbMATH DE number 6296695 (Why is no real title available?)
- Gutman index -- a critical personal account
- The minimum eccentric distance sum of trees with given distance \(k\)-domination number
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)