Abstract
We show that the class of graphs with quadratic stability number is not hereditary. Then we prove that this class contains a unique maximal hereditary subclass and, finally, we characterize this subclass by two forbidden induced subgraphs.
Similar content being viewed by others
References
M. Fiedler, “Algebraic connectivity of graphs,” Czech. Math. J., 23 298–305 (1973).
D. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs. Theory and Applications, Academic Press, Berlin–New York (1979).
C. J. Luz, “An upper bound on the independence number of a graph computable in polynomial time,” Oper. Res. Lett., 18, 139–145 (1995).
C. J. Luz, Um novo majorante para o número de estabilidade de um grafo obdito por técnicas de Programacão Quadrática, Ph.D. Thesis, Universidade de Aveiro (1996).
C. J. Luz and D. M. Cardoso, “A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph,” Ann. Oper. Res., 81, 307–309 (1998).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 71, Algebraic Techniques in Graph Theory and Optimization, 2011.
Rights and permissions
About this article
Cite this article
Cardoso, D.M., Lozin, V.V. On hereditary properties of the class of graphs with convex quadratic stability number. J Math Sci 182, 227–232 (2012). https://doi.org/10.1007/s10958-012-0743-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-012-0743-1