Eccentric counts, connectivity and chordality

Peter Dankelmann; David Erwin; Wayne Goddard; Simon Mukwembi; Henda C. Swart

doi:10.1016/j.ipl.2012.08.022

Eccentric counts, connectivity and chordality

Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart

Mathematics and Applied Mathematics

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

3 Citations (Scopus)

Abstract

Let e ^j denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on e ^j in graphs of given connectivity and in chordal graphs of given connectivity.

Original language	English
Pages (from-to)	944-947
Number of pages	4
Journal	Information Processing Letters
Volume	112
Issue number	24
DOIs	https://doi.org/10.1016/j.ipl.2012.08.022
Publication status	Published - 31 Dec 2012

Keywords

Chordal graph
Combinatorial problems
Connectivity
Eccentricity
Graphs

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2012.08.022

Cite this

@article{49e1038468914bc0b8ef4e731ea86a4f,

title = "Eccentric counts, connectivity and chordality",

abstract = "Let e j denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on e j in graphs of given connectivity and in chordal graphs of given connectivity.",

keywords = "Chordal graph, Combinatorial problems, Connectivity, Eccentricity, Graphs",

author = "Peter Dankelmann and David Erwin and Wayne Goddard and Simon Mukwembi and Swart, {Henda C.}",

year = "2012",

month = dec,

day = "31",

doi = "10.1016/j.ipl.2012.08.022",

language = "English",

volume = "112",

pages = "944--947",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "24",

}

TY - JOUR

T1 - Eccentric counts, connectivity and chordality

AU - Dankelmann, Peter

AU - Erwin, David

AU - Goddard, Wayne

AU - Mukwembi, Simon

AU - Swart, Henda C.

PY - 2012/12/31

Y1 - 2012/12/31

N2 - Let e j denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on e j in graphs of given connectivity and in chordal graphs of given connectivity.

AB - Let e j denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on e j in graphs of given connectivity and in chordal graphs of given connectivity.

KW - Chordal graph

KW - Combinatorial problems

KW - Connectivity

KW - Eccentricity

KW - Graphs

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

U2 - 10.1016/j.ipl.2012.08.022

DO - 10.1016/j.ipl.2012.08.022

M3 - Article

AN - SCOPUS:84865859665

SN - 0020-0190

VL - 112

SP - 944

EP - 947

JO - Information Processing Letters

JF - Information Processing Letters

IS - 24

ER -

Eccentric counts, connectivity and chordality

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this