• DOMINATING SETS OF SQUARE OF CENTIPEDES
Abstract
Let G = (V, E) be a simple graph. A set S Í V is a dominating set of G, if every vertex in V-S is adjacent to atleast one vertex in S. Let be the square of centipede corresponding to the path and let denote the family of all dominating sets of with cardinality i. In this paper, some properties of the dominating sets of centipedes are exhibited. Also, we characterized the number of dominating sets of and of cardinality i.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |