Independent Domination Number for 6-Alternative Snake graphs

Abstract

Let be a graph, has a subset , contains vertices with at least one vertex in that is not in , then is the dominating set of . If the vertices of are not adjacent to each other, then is an independent dominating set of and so the minimum cardinality of represents the IDN. As we already know about the concepts of framing -Alternative Triangular Snake graph, -Alternative Double Triangular Snake graph, -Alternative Quadrilateral Snake graph and -Alternative Double Quadrilateral Snake graph. In this paper, we find the IDN for 6-Alternative Triangular Snake graph and 6-Alternative Quadrilateral Snake graph