[J, K] – Set Domination of Sunlet Graph and Helm Graph

N. Murugesan; P. Elangovan

doi:https://doi.org/10.14445/22315373/IJMTT-V72I3P108

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 72 | Issue 3 | Year 2026 | Article Id. IJMTT-V72I3P108 | DOI : https://doi.org/10.14445/22315373/IJMTT-V72I3P108

[J, K] – Set Domination of Sunlet Graph and Helm Graph

N. Murugesan, P. Elangovan

Received	Revised	Accepted	Published
21 Jan 2026	26 Feb 2026	17 Apr 2026	29 Mar 2026

Citation :

N. Murugesan, P. Elangovan, "[J, K] – Set Domination of Sunlet Graph and Helm Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 72, no. 3, pp. 66-70, 2026. Crossref, https://doi.org/10.14445/22315373/IJMTT-V72I3P108

Abstract

Domination is an important theoretical concept in graph theory. The fastest-growing area in graph theory is the study of domination and related problems. By [J, K] set domination, a subset D ⊆ V in a graph G = (V, E) is a [J, K] set if every vertex v ∈ V – D, J ≤ | N (v) ∩D | ≤ K, for non-negative integer J and K, that is every vertex v ∈ V – D is adjacent to at least J but not more than K vertices in D. The domination number of G is denoted by Ɣ[𝐽,𝐾] (G), which is the minimum cardinality of a dominating se

Keywords

Dominating Set, Domination Number, [J, K] – Dominating Set, [J, K] – Domination Number.

References

[1] E.J. Cockayne, and S.T. Hedetniemi, “Towards a Theory of Domination in Graphs,” Networks, vol. 7, pp. 247-261, 1977.
[CrossRef] [Google Scholar] [Publisher Link]

[2] Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater, “Fundamentals of Domination in Graphs,” Marcel Dekkar, New York, 1998.
[Google Scholar]

[3] Mustapha Chellali et al., “[1, 2] – Sets in Graphs,” Discrete Applied Mathematics, vol. 162, no. 18, pp. 2885-2893, 2013.
[CrossRef] [Google Scholar] [Publisher Link]

[4] Øystein Ore, Theory of Graphs, American Mathematical Society, pp. 206-212, 1962.
[Google Scholar]

[5] E. Sampathkumar, [1,k] – Domination in a Graph, Journal of Mathematical and Physical Sciences, vol. 22, pp. 613-619, 1988. [Online]. Avaliable: https://www.researchgate.net/publication/341591826_1_k-domination_in_a_graph#:~:text=(PDF)%20(1%2C%20k,Book

[6] Douglas Brent West, “Introduction to Graph Theory,” Prentice Hall, 1996.
[Google Scholar] [Publisher Link

[7] Xiaojing Yang, and Baoyindureng Wu, “[1, 2] – Domination in Graphs,” Discrete Applied Mathematics, vol. 175, pp. 79-86, 2014.
[CrossRef] [Google Scholar] [Publisher Link]