Domination Parameters of Middle Graph of Sunlet Graph
B. Logapriya1, K. Pandiyan2
1Ms.B. Logapriya, Department of Science and Humanities, Sri Krishna College of Engineering and Technology, Coimbatore, India.
2Mr. K. Pandiyan, Department of Science and Humanities, Sri Krishna College of Engineering and Technology, Coimbatore, India.
Manuscript received on 30 May 2019 | Revised Manuscript received on 07 June 2019 | Manuscript published on 30 June 2019 | PP: 2023-2025 | Volume-8 Issue-8, June 2019 | Retrieval Number: H6548068819/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: If all the vertex of G is dominated by one vertex of S atleast, then a set S in vertex of G is a dominating set of G. The middle graph of an undirected graph G is another graph M(G) that represents adjacencies between vertex and edges of. In this paper, we obtain the domination parameters of middle graph of Sunlet graph Sn denoted by M(Sn) and its structural properties.
Keywords: Sunlet Graph, Middle Graph, Domination Paramters
Scope of the Article: Graph Algorithms and Graph Drawing