Abstract
Let G=(V(G),E(G)) be a graph. A k-dominating set in G is a subset X of V(G) such that each element of V(G)∖X is adjacent to at least k vertices of X. The least cardinality of a k-dominating set is the k-domination number. In this paper, we will give some bounds of the signless Laplacian spectrum of G involving the k-domination number.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
