Dominations In Semigraphs
D. Narmatha1, N. Murugesan2
1D. Narmatha, Assistant Professor, Department of mathematics, Sri Ramakrishna Engineering College, Coimbatore, India.
2N. Murugesan, Assistant Professor, Department of mathematics, Government Arts College, Coimbatore, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 563-568 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8060088619/2019©BEIESP | DOI: 10.35940/ijeat.F8060.088619
Open Access | Ethics and Policies | Cite | Mendeley
© 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: The semigraph generalization is more closely related to the axiom that the two edges in a semigraph have atmost one vertex in common, where as the hypergraph generalization is based on the consideration of an edge as a subset of two elements of the set of vertices of graphs. The concept of domination is an important parameter in graph theory. They provide a lot of space to the theoretical development of graphs and their applications. The dominations in semigraphs have no exception. In this paper, we study various dominations of semigraphs arising out of the corresponding adjacencies exist in semigraphs.
Keywords: a- Domination, ca- Domination, e – Domination, 1e – Domination, Independent Domination, Semigraph.