[1,2]-Complementary connected domination number of graphs-III
| dc.contributor.author | Mahadevan, G. | |
| dc.contributor.author | Renuka, K. | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-09T11:39:35Z | |
| dc.date.available | 2021-11-09T11:39:35Z | |
| dc.date.issued | 2019-08-01 | |
| dc.description.abstract | 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. | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 2312 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 2298 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.599813 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/75963 | |
| dc.identifier.volume | 68 | tr_TR |
| dc.language.iso | en | tr_TR |
| dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
| dc.relation.isversionof | 10.31801/cfsuasmas.599813 | tr_TR |
| dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
| dc.subject | Complementary connected domination | tr_TR |
| dc.title | [1,2]-Complementary connected domination number of graphs-III | tr_TR |
| dc.type | Article | tr_TR |