[1,2]-Complementary connected domination number of graphs-III

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
Volume:68 Issue:2
[1,2]-Complementary connected domination number of graphs-III

[1,2]-Complementary connected domination number of graphs-III

Authors : G MAHADEVAN, K RENUKA

Pages : 2298-2312

Doi:10.31801/cfsuasmas.599813

View : 43 | Download : 8

Publication Date : 2019-08-01

Article Type : Research Paper

Abstract :A set S⊆Vinsert ignore into journalissuearticles values(G); in a graph G is said to be [1,2]-complementary connected dominating set if for every vertex v∈V-S, 1≤|Ninsert ignore into journalissuearticles values(v);∩S|≤2 and is connected. The minimum cardinality of [1,2]-complementary connected dominating set is called [1,2]-complementary connected domination number and is denoted by γ_{[1,2]cc}insert ignore into journalissuearticles values(G);. In this paper, we investigate 3-regular graphs on twelve vertices for which γ_{[1,2]cc}insert ignore into journalissuearticles values(G);=χinsert ignore into journalissuearticles values(G);=3.
Keywords : Complementary connected domination

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.