Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs

DOI10.1016/j.dam.2019.06.003zbMath1426.05079OpenAlexW2955678532MaRDI QIDQ2334045

Simon Mukwembi, Peter Dankelmann, F. J. Osaye, Bernardo Gabriel Rodrigues

Publication date: 6 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.003

zbMATH Keywords

distanceeccentricityminimum degreeaverage eccentricitytotal eccentricity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (7)

The average Steiner 3-eccentricity of block graphs ⋮ The average eccentricity of a graph with prescribed girth ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ On the average Steiner 3-eccentricity of trees ⋮ Average eccentricity, minimum degree and maximum degree in graphs ⋮ On graphs with maximum average eccentricity

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 two conjectures on the Randić index and the average eccentricity
• A proof of the conjecture regarding the sum of domination number and average eccentricity
• Diameter of 4-colourable graphs
• Radius, diameter, and minimum degree
• Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
• Further results regarding the sum of domination number and average eccentricity
• Upper bounds on the average eccentricity
• Average distance, minimum degree, and spanning trees

This page was built for publication: Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs