Abstract
Domination is an important theoretic concept in graph theory. Various types of domination have been studied By [J, K] - Set domination, A subset D ⊆ V in a graph G = (V, E) is a [J, K] - Set if every Vertex ν ∈ V − D, J ⩽ |N(ν) ∩ D| ⩽ K for non negative integers J and K, that is every vertex ν ∈ V − D is adjacent to at least J but not more than K Vertices in D. The domination number of G is denoted by γ[ J,K ](G), which is the minimum cardinality of a dominating set G. In tis paper the [J, K] - domination number of some special graphs and its application ave been studied.
Full Text
Published Version (
Free)
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 call