Eccentric counts, connectivity and chordality

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

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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 languageEnglish
Pages (from-to)944-947
Number of pages4
JournalInformation Processing Letters
Issue number24
Publication statusPublished - 31 Dec 2012


  • Chordal graph
  • Combinatorial problems
  • Connectivity
  • Eccentricity
  • Graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Eccentric counts, connectivity and chordality'. Together they form a unique fingerprint.

Cite this