Average eccentricity, minimum degree and maximum degree in graphs

DOI10.1007/s10878-020-00616-xzbMath1466.05055arXiv1909.03286OpenAlexW3037096438MaRDI QIDQ2023121

Peter Dankelmann, F. J. Osaye

Publication date: 3 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.03286

zbMATH Keywords

distanceeccentricityminimum degreeaverage eccentricitymaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (5)

Wiener index in graphs with given minimum degree and maximum degree ⋮ The average eccentricity of a graph with prescribed girth ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eccentricity sums in trees
• On the extremal properties of the average eccentricity
• A proof of the conjecture regarding the sum of domination number and average eccentricity
• Radius, diameter, and minimum degree
• Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
• Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
• Upper bounds on the average eccentricity
• Average distance, minimum degree, and spanning trees

This page was built for publication: Average eccentricity, minimum degree and maximum degree in graphs