Independent Domination Number in Triangular & Quadrilateral Snake Graph
N. Senthur Priya1, S. Meenakshi2
1N. Senthur Priya, Department of Mathematics, Vels Institute of Science Technology and Advanced Studies, Pallavaram, Chennai (Tamil Nadu), India.
2S. Meenakshi, Department of Mathematics, Vels Institute of Science Technology and Advanced Studies, Pallavaram, Chennai (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 20-23 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10081284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1008.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: Let V be the vertex set and E be the edge set of a graph G, the vertex set V has a subset S such that S contains vertices which is adjacent to atleast one vertex in V which is not in S, then S is said to be dominating set of G. If the vertex in S is not adjacent to each other, then S is said to be independent dominating set of G and so i(G) denotes the independent domination number, the minimum cardinality of an independent dominating set in G. In this paper, we obtain independent domination number for a triangular snake, alternate triangular snake, double triangular snake, alternate double triangular snake, quadrilateral snake, alternate quadrilateral snake, double quadrilateral snake and alternate double quadrilateral snake graphs.
Keywords: Alternate Double Triangular Snake, Alternate Double Quadrilateral Snake, Alternate Quadrilateral Snake, Alternate Triangular Snake, Double Triangular Snake, Double Quadrilateral Snake, Quadrilateral Snake, Triangular Snake.
Scope of the Article: Cryptography and Applied Mathematics