SavedAdd your journal

Journals / Turkish Journal of Mathematics and Computer Science / 2019 / Cilt: 11 - Sayı: 1

Strong Roman Domination Number of Complementary Prism Graphs

Doost Ali MOJDEH
Ali PARSİAN
Iman MASOUMİ
Pages
40–47
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$.
📊
Key Findings & Data:Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$.
💡
Conclusion & Impact:Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Strong Roman domination · double Roman domination · Roman domination

Abstract

Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$. Also let

🔖

Cite This Article

MOJDEH, D. A., PARSİAN, A., MASOUMİ, I. (2019). Strong Roman Domination Number of Complementary Prism Graphs. Turkish Journal of Mathematics and Computer Science, Cilt: 11 - Sayı: 1, 40–47. https://ajindex.com/articles/374684

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (5)

  1. Alhashim, A., Desormeaux, W.J., Haynes, T.W., Roman domination in complementary prisms, Australasian journal of combinatorics, 68(2)(2017), 218--228. Alvarez-Ruiz, M.P., Mediavilla-Gradolph, T., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C., Yero, I.G., On the strong Roman domination number of graphs, Discrete Applied Mathematics, 231(2017), 44--59. Bermudo, S., Fernau, H., Sigarreta, J.M., The differential and the Roman domination number of a graph, Applicable Analysis and Discrete Mathematics, 8(2014), 155--171. Beeler, R.A., Haynesa, T.W., Hedetniemi, S.T., Double Roman domination, Discrete Applied Mathematics, 211(2016), 23--29. Cockayne, E.J., Dreyer, P.A., Hedetniemi, S.M., Hedetniemi, S.T., Roman domination in graphs, Discrete Mathematics, 278(2004), 11--22. Chambers, E.W., Kinnersley, B., Prince, N., West, D.B., Extermal problems for Roman domination, SIAM J. Discret Mathematics, 23(3)(2009), 1575--1586. Desormeaux, W.J., Haynes, T.W., Henning, M.A., Domination parameters of a graph and it\'s complement, Discussiones Mathematicae Graph Theory, 38(2018), 203--215. Gongora, J.A., Independent Domination in Complementary Prisms, Master\'s Thesis, East Tennessee State University, 2009.
  2. Haynes, T.W., Hedetniemi, S.T., Slater, P.J., Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
  3. Haynes, T.W., Holmes, K.R.S., Koessler, D.R., Sewell, L., Locating-Domination in Complementary Prisms of Paths and Cycles, Congressus Numerantium, 199(2009), 45--55. Haynes, T.W., Henning, M.A., Slater, P.J., van der Merwe, L.C., The complementary product of two graphs, Bulletin of the Institute of Combinatorics and its Applications, 51(2007), 21--30. Haynes, T.W., Henning, M.A., van der Merwe, L.C., Domination and total domination in complemantary prisms, Journal of Combinatorial Optimization, 18(2009), 23--37. Janseana, P., Ananchuen, N., Matching extension in complementary prism of regular graphs, Italian Journal of Pure and Applied Mathematics, 37(2017), 553--564. Lewis, J.R., Differentials of Graphs, Master\'s Thesis, East Tennessee State University, 2004.
  4. Mojdeh, D.A., Parsian, A., Masoumi, I., Characterization of double Roman trees, to appear in Ars Combinatoria, (2018).
  5. West, D.B., Introduction to Graph theory, Second edition, Prentice Hall, USA, 2001.