Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
From MaRDI portal
Publication:2078836
DOI10.1016/j.dam.2021.12.033zbMath1484.05109OpenAlexW4210412822MaRDI QIDQ2078836
Publication date: 4 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.12.033
Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Some extremal results on the connective eccentricity index of graphs
- On Harary index of graphs
- Further results on the eccentric distance sum
- Trees with the seven smallest and eight greatest Harary indices
- Comparison between the Szeged index and the eccentric connectivity index
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- On a novel eccentricity-based invariant of a graph
- On two eccentricity-based topological indices of graphs
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Some properties of the Zagreb eccentricity indices
- Facility Location Problems
This page was built for publication: Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree