Medium Domination Number in Linear Polyacene
S. Venkatesan1, M. Raji2, G. Jayalalitha3
1S. Venkatesan, Research Scholar, Department of Mathematics, VELS Institute of Science, Technology & Advanced Studies, Chennai, Tamil Nadu , India.
2M. Raji, Research Scholar, Department of Mathematics, VELS Institute of Science, Technology & Advanced Studies, Chennai, Tamil Nadu , India.
3G. Jayalalitha, Professor, Department of Mathematics, VELS Institute of Science, Technology & Advanced Studies, Chennai, Tamil Nadu , India.
Manuscript received on 20 August 2019 | Revised Manuscript received on 27 August 2019 | Manuscript Published on 31 August 2019 | PP: 459-461 | Volume-8 Issue-9S2 August 2019 | Retrieval Number: I10970789S219/19©BEIESP DOI: 10.35940/ijitee.I1097.0789S219
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: Let G(V,E) be a finite, connected graph. The set of vertices and edges of G are denoted by V=V(G) and E=E(G) respectively. In such a Molecular graph, vertices represent atoms and edges represent bonds. In this paper, it obtains Medium Domination Number in the Molecular Graph of Organic Compounds and proves by induction method.
Keywords: Dominating set, Medium Domination Number, Internally Disjoint Path, Molecular Graph. AMS Subject Classification.
Scope of the Article: Cryptography and Applied Mathematics