Upper bounds on the average eccentricity

Peter Dankelmann; Simon Mukwembi

doi:10.1016/j.dam.2013.11.023

Upper bounds on the average eccentricity

Peter Dankelmann, Simon Mukwembi

Mathematics and Applied Mathematics

University of KwaZulu-Natal

Research output: Contribution to journal › Article › peer-review

23 Citations (Scopus)

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).

Original language	English
Pages (from-to)	72-79
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	167
DOIs	https://doi.org/10.1016/j.dam.2013.11.023
Publication status	Published - 20 Apr 2014

Keywords

Average eccentricity
Chromatic number
Connected domination number
Domination number
Independence number

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2013.11.023

Cite this

@article{69ba0edf56c441659557036b0e55ceba,

title = "Upper bounds on the average eccentricity",

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 = "Average eccentricity, Chromatic number, Connected domination number, Domination number, Independence number",

author = "Peter Dankelmann and Simon Mukwembi",

year = "2014",

month = apr,

day = "20",

doi = "10.1016/j.dam.2013.11.023",

language = "English",

volume = "167",

pages = "72--79",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Upper bounds on the average eccentricity

AU - Dankelmann, Peter

AU - Mukwembi, Simon

PY - 2014/4/20

Y1 - 2014/4/20

N2 - 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).

AB - 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).

KW - Average eccentricity

KW - Chromatic number

KW - Connected domination number

KW - Domination number

KW - Independence number

UR - http://www.scopus.com/inward/record.url?scp=84894456380&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2013.11.023

DO - 10.1016/j.dam.2013.11.023

M3 - Article

AN - SCOPUS:84894456380

SN - 0166-218X

VL - 167

SP - 72

EP - 79

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Upper bounds on the average eccentricity

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this