On the eccentric distance sum of trees with given maximum degree
From MaRDI portal
Publication:6204297
DOI10.1016/j.dam.2024.01.009MaRDI QIDQ6204297
Ting Zhou, Lian-Ying Miao, Wen Yao Song
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)
Cites Work
- Degree distance of unicyclic and bicyclic graphs
- On the eccentric distance sum of graphs
- A short and unified proof of Yu et al.'s two results on the eccentric distance sum
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- On the extremal values of the eccentric distance sum of trees with a given maximum degree
- On graphs having domination number half their order
- Wiener index versus maximum degree in trees
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Superdominance order and distance of trees with bounded maximum degree
- Eccentric adjacency index of graphs with a given number of cut edges
- On the extremal values of the eccentric distance sum of trees with a given domination number
- Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
- Extreme Wiener indices of trees with given number of vertices of maximum degree
- Extremal values on the eccentric distance sum of trees
- Eccentric Connectivity Index of Chemical Trees
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
This page was built for publication: On the eccentric distance sum of trees with given maximum degree
