Complementary connected domination and connectivity domination number of an arithmetic graph G=Vn

S. Sujitha, L. Mary Jenitha, M.K. Angel Jebitha

Abstract


A subset S of V is said to be a complementary connected dominating set if every vertex not in S is adjacent to some vertex in S and the sub graph induced by V−S is connected. The complementary connected domination number of the graph is denoted by γccd(G) and is defined as the minimum number of vertices which form a ccd-set. A set S of vertices in a graph G is a connectivity dominating set if every vertex not in S is adjacent to some vertex in S and the sub graph induced by V−S is not connected. The connectivity domination number κγ(G) is the minimum size of such set.

Full Text: PDF

Published: 2022-01-24

How to Cite this Article:

S. Sujitha, L. Mary Jenitha, M.K. Angel Jebitha, Complementary connected domination and connectivity domination number of an arithmetic graph G=Vn, J. Math. Comput. Sci., 12 (2022), Article ID 64

Copyright © 2022 S. Sujitha, L. Mary Jenitha, M.K. Angel Jebitha. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS