"A characterization of the Centers of Chordal Graphs" by James Shook
 

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

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.