Upper bounds on the average eccentricity

DOI10.1016/j.dam.2013.11.023zbMath1284.05194OpenAlexW2017229004MaRDI QIDQ2440101

Peter Dankelmann, Simon Mukwembi

Publication date: 27 March 2014

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

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

zbMATH Keywords

independence numberchromatic numberdomination numberaverage eccentricityconnected domination number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (20)

Eccentricity sums in trees ⋮ The average Steiner 3-eccentricity of block graphs ⋮ On autographix conjecture regarding domination number and average eccentricity ⋮ 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 ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ A proof of the conjecture regarding the sum of domination number and average eccentricity ⋮ Average eccentricity, \(k\)-packing and \(k\)-domination in graphs ⋮ Further results regarding the sum of domination number and average eccentricity ⋮ On the average Steiner 3-eccentricity of trees ⋮ The Steiner \(k\)-eccentricity on trees ⋮ Average eccentricity, minimum degree and maximum degree in graphs ⋮ The normality and sum of normalities of trees ⋮ Constructing uniform central graphs and embedding into them ⋮ On graphs with maximum average eccentricity ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ Connected Domination ⋮ Ordering graphs with large eccentricity-based topological indices ⋮ Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs ⋮ Some extremal problems on the distance involving peripheral vertices of trees with given matching number

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the eccentric distance sum of trees and unicyclic graphs
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
• Domination, radius, and minimum degree
• Eccentric sequences in graphs
• Average distance and independence number
• Average distance and domination number
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Average distance and domination number revisited
• AutoGraphiX: a survey
• ON DISTANCES IN CHROMATIC GRAPHS
• The average distance and the independence number
• Average Distance, Independence Number, and Spanning Trees

This page was built for publication: Upper bounds on the average eccentricity