[1,2] -Connected domination number of graphs

Main Article Content

G. Mahadevan, et. al.


  A set  in a graph G is said to be a -connected dominating set if for every vertex ,  and  is connected. The minimum cardinality of a -connected dominating set is called the -connected domination number and is denoted by . In this paper, we initiate a study of this parameter.  



Download data is not yet available.


Metrics Loading ...

Article Details

How to Cite
et. al., G. M. . (2021). [1,2] -Connected domination number of graphs . Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(13), 5100–5105. https://doi.org/10.17762/turcomat.v12i13.9685
Research Articles