[1,2]-Complementary connected domination number for total graphs
Main Article Content
Abstract
A set in a graph G is said to be a -complementary connected dominating set, if for every vertex , and is connected. The minimum cardinality of a -complementary connected dominating set is called the -complementary connected domination number and is denoted by . In this paper, we exhibited the results based on -complementary connected domination number for total graph.
Article Details
Issue
Section
Articles