Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Discrete Mathematics and Combinatorics
On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar
On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar
Applications and Applied Mathematics: An International Journal (AAM)
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is dominated by some element of set S. If e is an edge with end vertices u and v and degree of u is greater than or equal to degree of v then we say u strongly dominates v. If every vertex of V - S is strongly dominated by some vertex of S then S is called strong dominating set. The minimum cardinality of a strong dominating set is called the strong domination number of graph. We …
Independent Domination In Some Wheel Related Graphs, S. K. Vaidya, R. M. Pandit
Independent Domination In Some Wheel Related Graphs, S. K. Vaidya, R. M. Pandit
Applications and Applied Mathematics: An International Journal (AAM)
A set S of vertices in a graph G is called an independent dominating set if S is both independent and dominating. The independent domination number of G is the minimum cardinality of an independent dominating set in G . In this paper, we investigate the exact value of independent domination number for some wheel related graphs.