Araştırma Makalesi

Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm

Cilt: 29 Sayı: 2 31 Ağustos 2024
PDF İndir
TR EN

Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm

Öz

Let G=(V,E) be a graph. A function f:V→\{0,1,2\}, if ∀u for which f(u)=0 is adjacent to ∃v for which f(v)=2, is called a Roman dominating function, and called in short terms RDF. The weight of an RDF f is f(V)=∑_(v∈V)▒f(v) . The Roman domination number of a graph G, denoted by γ_R (G), is the minimum weight of an RDF on G. This paper presents the results for Roman domination numbers of the Mycielski graphs obtained through Mycielski's construction of the comet, double comet, and comb graphs. An algorithm to determine the Roman domination number of any given graph is also provided.

Anahtar Kelimeler

Algorithm, Graph Theory, Roman Domination

Kaynakça

  1. Chambers, E. W., Kinnersley, B., Prince, N., & West, D. B. (2009). Extremal problems for Roman domination. SIAM Journal on Discrete Mathematics, 23(3), 1575-1586. https://doi.org/10.1137/070699688
  2. Cockayne, E. J., Dreyer Jr, P. A., Hedetniemi, S. M., & Hedetniemi, S. T. (2004). Roman domination in graphs. Discrete Mathematics, 278(1-3), 11-22. https://doi.org/10.1016/j.disc.2003.06.004
  3. Dreyer, P. A. (2000). Applications and variations of domination in graphs. (PhD), Rutgers University, New Jersey.
  4. Durgun, D. D., & Toprakkaya, E. N. (2021). Roman domination of the Comet, Double Comet, and Comb Graphs. arXiv preprint arXiv:2102.07902. https://doi.org/10.48550/arXiv.2102.07902
  5. Durgun, D. D., & Toprakkaya, E. N. (2023). Roman domination on some graphs. Journal of Modern Technology and Engineering, 8(2), 96-104.
  6. Haynes, T. W., Hedetniemi, S., & Slater, P. (1998). Fundamentals of domination in graphs. CRC Press. https://doi.org/10.1201/9781482246582
  7. Henning, M. A., & Hedetniemi, S. T. (2003). Defending the Roman Empire - A new strategy. Discrete Mathematics, 266(1-3), 239-251. https://doi.org/10.1016/S0012-365X(02)00811-7
  8. Kazemi, A. P. (2012). Roman domination and Mycielski’s structure in graphs. Ars Combinatoria, 106, 277-287.
  9. Liedloff, M., Kloks, T., Liu, J., & Peng, S. (2008). Efficient algorithms for Roman domination on some classes of graphs. Discrete Applied Mathematics, 156(18), 3400-3415. https://doi.org/10.1016/j.dam.2008.01.011
  10. Stewart, I. (1999). Defend the Roman Empire!, Scientific American, 281(6), 136-138. https://doi.org/10.1038/scientificamerican1299-136

Kaynak Göster

APA
Dogan Durgun, D., & Toprakkaya, E. N. (2024). Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm. Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 29(2), 494-502. https://doi.org/10.53433/yyufbed.1442759
AMA
1.Dogan Durgun D, Toprakkaya EN. Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm. YYUFBED. 2024;29(2):494-502. doi:10.53433/yyufbed.1442759
Chicago
Dogan Durgun, Derya, ve Emre Niyazi Toprakkaya. 2024. “Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm”. Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi 29 (2): 494-502. https://doi.org/10.53433/yyufbed.1442759.
EndNote
Dogan Durgun D, Toprakkaya EN (01 Ağustos 2024) Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm. Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi 29 2 494–502.
IEEE
[1]D. Dogan Durgun ve E. N. Toprakkaya, “Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm”, YYUFBED, c. 29, sy 2, ss. 494–502, Ağu. 2024, doi: 10.53433/yyufbed.1442759.
ISNAD
Dogan Durgun, Derya - Toprakkaya, Emre Niyazi. “Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm”. Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi 29/2 (01 Ağustos 2024): 494-502. https://doi.org/10.53433/yyufbed.1442759.
JAMA
1.Dogan Durgun D, Toprakkaya EN. Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm. YYUFBED. 2024;29:494–502.
MLA
Dogan Durgun, Derya, ve Emre Niyazi Toprakkaya. “Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm”. Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi, c. 29, sy 2, Ağustos 2024, ss. 494-02, doi:10.53433/yyufbed.1442759.
Vancouver
1.Derya Dogan Durgun, Emre Niyazi Toprakkaya. Roman Domination in Mycielski Graphs: A Study of Some Graphs and a Heuristic Algorithm. YYUFBED. 01 Ağustos 2024;29(2):494-502. doi:10.53433/yyufbed.1442759