Open AccessIndependent Domination Number in Triangular & Quadrilateral Snake graph
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1008.1284s519
Subject(s) - quadrilateral , combinatorics , vertex (graph theory) , mathematics , dominating set , domination analysis , graph , physics , finite element method , thermodynamics
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.