Domination Integrity of Some Special Graphs
D. Bhuvaneswari1, S. Meenakshi2
1D. Bhuvaneswari, Research Scholar, Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies, Chennai (Tamil Nadu), India.
2S. Meenakshi, Associate Professor, Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies, Chennai (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 40-45 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10171284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1017.1284S519
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: A major importance is given to the stability of a network by its users and designers. Domination Integrity is one of the parameter used to determine the network’s vulnerability and its defined for a connected graph G as “ DI(G) = min{| X | +m(G – X) : X is a dominating set} wh ere m(G-X) is the order of maximum component of G-X”, by Sundareswaran and Swaminathan. Here we investigate the domination integrity of Tadpole graph, Lollipop graph and a line graph of composition of nP and P2.
Keywords: Domination Integrity, Line Graph, Lollipop Graph, Tadpole Graph.
Scope of the Article: Cryptography and Applied Mathematics