Document Type
Lecture
Publication Date
10-31-2008
Abstract
A graph is chordal if it does not have any induced cycles with length greater than three. The distance d(xy) is the length of the shortest path from x to y. The eccentricity of graph is (x) = maxd(xy)y V(G) and its radius and diameter are de ned respectively as Rad(G) = min (x)x V(G) and Diam(G) = max (x)x V(G) . The subgraph induced by all vertices of G with eccentricity equal to the radius is called the center of G. This paper presents a short and simple characterization of the centers of chordal graphs.
Relational Format
presentation
Recommended Citation
Shook, James, "A characterization of the Centers of Chordal Graphs" (2008). Combinatorics Seminar. 87.
https://egrove.olemiss.edu/math_combinatorics/87
COinS
