| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427662 | Information Processing Letters | 2012 | 4 Pages |
Abstract
Let ejej denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on ejej in graphs of given connectivity and in chordal graphs of given connectivity.
► Let ejej denote the number of vertices of eccentricity j in a graph. ► We provide sharp lower bounds on ejej in graphs of given connectivity. ► We prove sharp lower bounds on ejej in chordal graphs of given connectivity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart,