Samenvatting
Let G be a connected graph of order n with domination number γ(G). Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eigenvalue λ of G with multiplicity mG(λ), it holds that γ(G)≤n−mG(λ). Using techniques from the theory of star sets, in this work we prove that the same bound holds when λ is an arbitrary adjacency eigenvalue of a non-regular graph, and we characterize the cases of equality. Moreover, we show a result that gives a relationship between start sets and the p-domination number, and we apply it to extend the aforementioned spectral bound to the p-domination number using the adjacency and Laplacian eigenvalue multiplicities.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 319-330 |
Aantal pagina's | 12 |
Tijdschrift | Linear Algebra and Its Applications |
Volume | 658 |
DOI's | |
Status | Gepubliceerd - 1 feb. 2023 |
Bibliografische nota
Funding Information:S. Akbari is partially funded by the Iran National Science Foundation (INSF), grant 96004167 .
Funding Information:
A. Abiad is partially funded by the Fonds Wetenschappelijk Onderzoek (FWO), grant 1285921N .