| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418769 | Discrete Applied Mathematics | 2014 | 8 Pages |
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).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Peter Dankelmann, Simon Mukwembi,