Abstract
For an integer-valued function ƒ defined on the vertices of a graph G, the ƒ- domination number γ ƒ(G) of G is the smallest cardinality of a subset D ⊆ V( G) such that each x ∈ V( G) − D is adjacent to at least ƒ(x) vertices in D. When ƒ(x) = k for all x ∈ V(G), γ ƒ(G) is the k-domination number γ k ( G). In this note, we give a tight upper bound for γ ƒ and an improvement of the upper bound for a special ƒ- domination number μ j, k of Stracke and Volkmann (1993). Some upper bounds for γ k are also obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.