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

G. Mahadevan; K. Renuka

doi:10.31801/cfsuasmas.599813

Araştırma Makalesi

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

Yıl 2019, Cilt: 68 Sayı: 2, 2298 - 2312, 01.08.2019

G. Mahadevan K. Renuka

https://doi.org/10.31801/cfsuasmas.599813

Öz

A set S⊆V(G) in a graph G is said to be [1,2]-complementary connected dominating set if for every vertex v∈V-S, 1≤|N(v)∩S|≤2 and <V-S> 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}(G). In this paper, we investigate 3-regular graphs on twelve vertices for which γ_{[1,2]cc}(G)=χ(G)=3.

Anahtar Kelimeler

Complementary connected domination

Kaynakça

Chartrand, G.and Lesniak, L., Graphs and Digraphs, Fourth Edition CRC Press, Boca Raton, 2005.
Haynes, T.W., Hedetniemi, S.T. and Slater, P.J., Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
Chellali, Mustapha, Haynes, Teresa W., Hedetniemi, Stephen T. and McRae, Alice, [1,2]-Sets in graphs, Discrete Applied Mathematics, 161, (2013), 2885-2893.
Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs, International Journal of Computational and Applied Mathematics, 12(1), (2017), 281-288.
Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs-II, International Journal of Pure and Applied Mathematics, 117(11), (2017), 165-175.
Kulli, V.R. and Janakiraman, B., The nonsplit domination number of a graph, Indian Journal of Pure and Applied Math, Vol. 31, No. 5, (2000), 545-550.
Yang, Xiaojing and Wu, Baoyindureng, [1,2]-domination in graphs, Discrete Applied Mathematics, 175, (2014), 79-86.

Yıl 2019, Cilt: 68 Sayı: 2, 2298 - 2312, 01.08.2019

G. Mahadevan K. Renuka

https://doi.org/10.31801/cfsuasmas.599813

Öz

Kaynakça

Chartrand, G.and Lesniak, L., Graphs and Digraphs, Fourth Edition CRC Press, Boca Raton, 2005.
Haynes, T.W., Hedetniemi, S.T. and Slater, P.J., Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
Chellali, Mustapha, Haynes, Teresa W., Hedetniemi, Stephen T. and McRae, Alice, [1,2]-Sets in graphs, Discrete Applied Mathematics, 161, (2013), 2885-2893.
Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs, International Journal of Computational and Applied Mathematics, 12(1), (2017), 281-288.
Mahadevan, G., Renuka, K. and Sivagnanam, C., [1,2]-Complementary connected domination number of graphs-II, International Journal of Pure and Applied Mathematics, 117(11), (2017), 165-175.
Kulli, V.R. and Janakiraman, B., The nonsplit domination number of a graph, Indian Journal of Pure and Applied Math, Vol. 31, No. 5, (2000), 545-550.
Yang, Xiaojing and Wu, Baoyindureng, [1,2]-domination in graphs, Discrete Applied Mathematics, 175, (2014), 79-86.

Toplam 7 adet kaynakça vardır.

Ayrıntılar

Birincil Dil	İngilizce
Konular	Matematik
Bölüm	Makaleler
Yazarlar	G. Mahadevan 0000-0002-1471-1626 K. Renuka 0000-0001-7573-2191
Yayımlanma Tarihi	1 Ağustos 2019
Gönderilme Tarihi	5 Şubat 2018
Kabul Tarihi	25 Haziran 2018
Yayımlandığı Sayı	Yıl 2019 Cilt: 68 Sayı: 2

Kaynak Göster

APA	Mahadevan, G., & Renuka, K. (2019). [1,2]-Complementary connected domination number of graphs-III. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, 68(2), 2298-2312. https://doi.org/10.31801/cfsuasmas.599813
AMA	Mahadevan G, Renuka K. [1,2]-Complementary connected domination number of graphs-III. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. Ağustos 2019;68(2):2298-2312. doi:10.31801/cfsuasmas.599813
Chicago	Mahadevan, G., ve K. Renuka. “[1,2]-Complementary Connected Domination Number of Graphs-III”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 68, sy. 2 (Ağustos 2019): 2298-2312. https://doi.org/10.31801/cfsuasmas.599813.
EndNote	Mahadevan G, Renuka K (01 Ağustos 2019) [1,2]-Complementary connected domination number of graphs-III. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 68 2 2298–2312.
IEEE	G. Mahadevan ve K. Renuka, “[1,2]-Complementary connected domination number of graphs-III”, Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat., c. 68, sy. 2, ss. 2298–2312, 2019, doi: 10.31801/cfsuasmas.599813.
ISNAD	Mahadevan, G. - Renuka, K. “[1,2]-Complementary Connected Domination Number of Graphs-III”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 68/2 (Ağustos 2019), 2298-2312. https://doi.org/10.31801/cfsuasmas.599813.
JAMA	Mahadevan G, Renuka K. [1,2]-Complementary connected domination number of graphs-III. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2019;68:2298–2312.
MLA	Mahadevan, G. ve K. Renuka. “[1,2]-Complementary Connected Domination Number of Graphs-III”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, c. 68, sy. 2, 2019, ss. 2298-12, doi:10.31801/cfsuasmas.599813.
Vancouver	Mahadevan G, Renuka K. [1,2]-Complementary connected domination number of graphs-III. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2019;68(2):2298-312.