论文信息 - GRAPHS WITH LEAST EIGENVALUE −2 ATTAINING A CONVEX QUADRATIC UPPER BOUND FOR THE STABILITY NUMBER

GRAPHS WITH LEAST EIGENVALUE −2 ATTAINING A CONVEX QUADRATIC UPPER BOUND FOR THE STABILITY NUMBER

A b s t r a c t. In this paper we study the conditions under which the stability number of line graphs, generalized line graphs and exceptional graphs attains a convex quadratic programming upper bound. In regular graphs this bound is reduced to the well known Hoffman bound. Some vertex subsets inducing subgraphs with regularity properties are analyzed. Based on an observation concerning the Hoffman bound a new construction of regular exceptional graphs is provided.

Dragoš Cvetković | Domingos M. Cardoso | D. Cvetkovic | D. Cardoso

[1] J. Seidel,et al. Line graphs, root systems, and elliptic geometry , 1976 .

[2] Domingos M. Cardoso. Convex Quadratic Programming Approach to the Maximum Matching Problem , 2001, J. Glob. Optim..

[3] Rommel M. Barbosa,et al. On regular-stable graphs , 2004, Ars Comb..

[4] Michael Doob,et al. Generalized line graphs , 1981, J. Graph Theory.

[5] Dragoš Cvetković,et al. Graphs related to exceptional root systems , 1976 .

[6] D. Cvetkovic,et al. Graphs with Least Eigenvalue −2: The Star Complement Technique , 2001 .

[7] M. Newman. Independent Sets and Eigenspaces , 2004 .

[8] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[9] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[10] Domingos M. Cardoso,et al. Equitable Bipartitions of Graphs and Related Results , 2004 .

[11] Dragoš Cvetković,et al. Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 , 2004 .

[12] Carlos J. Luz. An upper bound on the independence number of a graph computable in polynomial-time , 1995, Oper. Res. Lett..