|
Organizers |
A characterization of the Centers of Chordal Graphs
by
James Shook
University of Mississippi
Coauthors: Bing Wei
A graph is chordal if it does not have any induced cycles with length greater than three. The distance d(x, y) is the length of the shortest path from x to y. The eccentricity of graph is e(x)=max{d(x, y)|y ∈ V(G)} and its radius and diameter are defined respectively as Rad(G)=min{e(x)|x ∈ V(G)} and Diam(G)=max{e(x)|x ∈ V(G)}. The subgraph induced by all vertices of G with eccentricity equal to the radius is called the center of G. In this talk we will present a short and simple characterization of the centers of chordal graphs.
Date received: April 1, 2009
Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-09.