Unified bounds for the independence number of graphs
Canadian journal of mathematics, Tome 77 (2025) no. 1, pp. 97-117
Voir la notice de l'article provenant de la source Cambridge
The Hoffman ratio bound, Lovász theta function, and Schrijver theta function are classical upper bounds for the independence number of graphs, which are useful in graph theory, extremal combinatorics, and information theory. By using generalized inverses and eigenvalues of graph matrices, we give bounds for independence sets and the independence number of graphs. Our bounds unify the Lovász theta function, Schrijver theta function, and Hoffman-type bounds, and we obtain the necessary and sufficient conditions of graphs attaining these bounds. Our work leads to some simple structural and spectral conditions for determining a maximum independent set, the independence number, the Shannon capacity, and the Lovász theta function of a graph.
Mots-clés :
Independence number, graph matrix, Lovász theta function, Shannon capacity, generalized inverse, eigenvalue
Zhou, Jiang. Unified bounds for the independence number of graphs. Canadian journal of mathematics, Tome 77 (2025) no. 1, pp. 97-117. doi: 10.4153/S0008414X23000822
@article{10_4153_S0008414X23000822,
author = {Zhou, Jiang},
title = {Unified bounds for the independence number of graphs},
journal = {Canadian journal of mathematics},
pages = {97--117},
year = {2025},
volume = {77},
number = {1},
doi = {10.4153/S0008414X23000822},
url = {http://geodesic.mathdoc.fr/articles/10.4153/S0008414X23000822/}
}
Cité par Sources :