Journals / Communications Faculty of Sciences University of Ankara Series A1: Mathematics and Statistics / 2019 / Cilt: 68 - Sayı: 2
[1,2]-COMPLEMENTARY CONNECTED DOMINATION NUMBER OF GRAPHS-III
- Journal
- Communications Faculty of Sciences University of Ankara Series A1: Mathematics and Statistics
- Pages
- 2298–2312
- DOI
- —
Abstract
A set S V (G) in a graph G is said to be [1,2]-complementaryconnected dominating set if for every vertex v 2 V S, 1 jN(v)Sj 2 and is connected. The minimum cardinality of [1,2]-complementary connected dominating set is called [1; 2]complementary connected dominationnumber and is denoted by [1;2]cc(G). In this paper, we investigate 3regulargraphs on twelve vertices for which [1;2]cc(G) = x(G) =3.