Connected Certified Domination In The Middle Graph Of Certain Graphs

Article Sidebar

PDF
Published: Oct 20, 2023
DOI: https://doi.org/10.53555/jrtdd.v6i10s(2).2724
Keywords:
Dominating set certified dominating set certified domination number connected certified domination Middle graphs.

Main Article Content

Dr. M. Deva Saroja
R. Aneesh

Abstract

A dominating set S of a graph  is called a certified dominating set of G. If every vertices in S has either zero or at least two neighbours in  A certified dominating set S of G is said to be connected certified dominating set if the subgraph induced by S is connected. The minimum cardinality taken over  all the connected certified dominating set is called the connected certified domination number of G and is denoted by in this paper, we investigate the connected certified domination number of middle graphs of certain graphs.

Article Details

How to Cite
Dr. M. Deva Saroja, & R. Aneesh. (2023). Connected Certified Domination In The Middle Graph Of Certain Graphs. Journal for ReAttach Therapy and Developmental Diversities, 6(10s(2), 2126–2132. https://doi.org/10.53555/jrtdd.v6i10s(2).2724
Issue
Vol. 6 No. 10s(2) (2023)
Section
Articles
Author Biographies

Dr. M. Deva Saroja

Assstant Professor, PG & Research Department of Mathematics, Ran Anna Government College for Women, Tirunelveli, 627008, Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli -627012, Tamil Nadu, India.

 

R. Aneesh

Reserach Scholar, Reg. No. 20121172091017, Ran Anna Government College, for Women, Tirunelveli, 627008, Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli -627012, Tamil Nadu, India

References

J.A. Bondy and U.S.R. Murty, Graph theory, Graduate texts in mathematics, vol. 244, springer Science and Meda, 2008.

T.W.Haynes, S.T. Hedetneimi and P.J.Slater, Fundamental of Domination in Graphs, Marcel Dekker, New York, 1998.

T.W.Haynes, S.T. Hedetneimi and P.J.Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.

M.A. Henning and A. Yeo, Total domination in graphs, Springer Monographs n Mathematics, 2013.

F. Kazemnejad and S. Morad, Total domination number of central graphs, Bulletin of the Korean Mathematical Socety, 56(4) (2019), 1059-1075. Math. Soc. 56(4), pp.1059-1075.

Danuta Michalak, On middle and total graphs with coarseness number equal to 1: Graph Theory, Proc. Conf; Lagow/pol. Lecture notes Math1018 Springer, berlin, 139-150 (1983).

S. Durai Raj, S.G. Shiji Kumari and A.M.Anto, Certified Domination Number in product of Graphs, Turkish Journal of Computer and Mathematical Education 11(3), 1166-1170(2020).

S. Durai Raj, S.G. Shiji Kumari and A.M.Anto, Certified Domination Number in Corona Product of Graphs, Malaya Journal of Mathematik 9(1), 1080-1082 (2021).

M. Dettlaft, M. Lemansko, J. Topp, R. Ziemann and P. Zylinski, Certified Domination, AKCE International Journal of Graphs and Combinatorics (Article press), (2018).

Azham IIyass, Vishwajeet S, Goswami, Connected certified Domination Number of certain graphs, Advancements in Physical & Mathematical Sciences, AP Conference Proceedings, 2735(1) (2023).