Gallai and Anti-Gallai Graphs of S (N, M) Graphs
R. Ganapathy Raman1, S. Gayathri2
1Dr. R. Ganapathy Raman, Assistant Professor, Department of Mathematics, Pachaiyappa’s College, Chennai (Tamil Nadu), India.
2S. Gayathri, Research Scholar, Department of Mathematics, Pachaiyappa’s College, Chennai (Tamil Nadu), India.
Manuscript received on 27 March 2019 | Revised Manuscript received on 06 April 2019 | Manuscript Published on 27 April 2019 | PP: 800-802 | Volume-7 Issue-6S2 April 2019 | Retrieval Number: F10840476S219/2019©BEIESP
Open Access | Editorial and Publishing 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: This paper deals with the graph operators – Gallai and Anti -Gallaigraphs. The Gallai graph and the anti-Gallai graph of a graph G have the edges of G as their vertices. Two edges of G are adjacent in the Gallai graph of G if they are incident but do not span a triangle in G; they are adjacent in the anti-Gallai graph of G if they span a triangle in G. We discuss about the Gallai and Anti -Gallai graphs of S(n,m) Graphs.
Keywords: Anti – Gallai Graphs, Gallai Graphs, S(n,m) Graphs.
Scope of the Article: Cryptography and Applied Mathematics