CO-REGULAR SPLIT DOMINATION IN GRAPHS

M.H.Muddebihal, Priyaka.H.Madarvadkar
Page No: 116-122
DOI: 10.86493/OTJ.2433509
Download PDFAbstract:
In this paper, we introduce the new concept in domination theory. A dominating set 𝐷 βŠ† 𝑉(𝐺) is a coregular split dominating set if the induced subgraph < 𝑉 βˆ’ 𝐷 > is regular and disconnected. The minimum cardinality of such a set is called a coregular split domination number and is denoted by π›Ύπ‘π‘Ÿπ‘ (𝐺). Also we study the graph theoretic property of π›Ύπ‘π‘Ÿπ‘ (𝐺) and many bounds were obtained interms of 𝐺 and its relationship with other domination parameters were found

Citations

APA: M.H.Muddebihal, Priyaka.H.Madarvadkar (2025). CO-REGULAR SPLIT DOMINATION IN GRAPHS. DOI: 10.86493/OTJ.2433509

AMA: M.H.Muddebihal, Priyaka.H.Madarvadkar. CO-REGULAR SPLIT DOMINATION IN GRAPHS. 2025. DOI: 10.86493/OTJ.2433509

Chicago: M.H.Muddebihal, Priyaka.H.Madarvadkar. "CO-REGULAR SPLIT DOMINATION IN GRAPHS." Published 2025. DOI: 10.86493/OTJ.2433509

IEEE: M.H.Muddebihal, Priyaka.H.Madarvadkar, "CO-REGULAR SPLIT DOMINATION IN GRAPHS," 2025, DOI: 10.86493/OTJ.2433509

ISNAD: M.H.Muddebihal, Priyaka.H.Madarvadkar. "CO-REGULAR SPLIT DOMINATION IN GRAPHS." DOI: 10.86493/OTJ.2433509

MLA: M.H.Muddebihal, Priyaka.H.Madarvadkar. "CO-REGULAR SPLIT DOMINATION IN GRAPHS." 2025, DOI: 10.86493/OTJ.2433509