论文信息 - A Characterization of Graphs Where the Independence Number Equals the Radius

A Characterization of Graphs Where the Independence Number Equals the Radius

In a classical 1986 paper by Erdös, Saks and Saós every graph of radius r has an induced path of order at least 2r − 1. This result implies that the independence number of such graphs is at least r. In this paper, we use a result of S. Fajtlowicz about radius-critical graphs to characterize graphs where the independence number is equal to the radius, for all possible values of the radius except 2, 3, and 4. We briefly discuss these remaining cases as well.

[1] Zsolt Tuza,et al. A characterization of graphs without long induced paths , 1990, J. Graph Theory.

[2] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.

[3] Siemion Fajtlowicz. A characterization of radius-critical graphs , 1988, J. Graph Theory.

[4] Xiaodong Zhang. On the two conjectures of Graffiti , 2004 .

[5] Craig E. Larson,et al. Graph theoretic independence and critical independent sets , 2008 .

[6] E. DeLaViña,et al. INDEPENDENCE , RADIUS AND HAMILTONIAN PATHS , 2006 .

[7] Michael E. Saks,et al. Maximum induced trees in graphs , 1986, J. Comb. Theory, Ser. B.

[8] D. Freed,et al. A modk index theorem , 1992 .