Upper bounds on the average eccentricity

Authors:
Peter Dankelmann;Simon Mukwembi
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 6
Cited 0

Average distance and independence number

2nd Twente workshop on Graphs and combinatorial optimization
Average distance and domination number

Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Variable neighborhood search for extremal graphs: 1 the AutoGraphiX system

Discrete Mathematics
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

Discrete Applied Mathematics
Note: Domination, radius, and minimum degree

Discrete Applied Mathematics
Note: Average distance and domination number revisited

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Sharp upper bounds on the average eccentricity of a connected graph of given order in terms of its independence number, chromatic number, domination number or connected domination number are given. Our results settle two conjectures of the computer program AutoGraphiX (Aouchiche et al., 2005).