Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 19, 2022 - Issue 3
Submit an article Journal homepage
633
Views
1
CrossRef citations to date
0
Altmetric
Articles

An improved upper bound on the independent double Roman domination number of trees

F. Nahani Poura Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, IranView further author information
,
H. Abdollahzadeh Ahangarb Department of Mathematics, Babol Noshirvani University of Technology, Babol, IranCorrespondence[email protected]
View further author information
,
M. Chellalic LAMDA-RO Laboratory, Department of Mathematics, University of BlidaB.P. 270, Blida, AlgeriaView further author information
&
S. M. Sheikholeslamia Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, IranView further author information
Pages 206-210 | Received 22 Oct 2021, Accepted 21 Jun 2022, Published online: 12 Jul 2022

References

  • Abdollahzadeh Ahangar, H., Amjadi, J., Atapour, M., Chellali, M., Sheikholeslami, S. M. (2019). Double Roman trees. Ars. Combin. 145: 173–183.
  • Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S. M. (2017). On the double Roman domination in graphs. Discrete Appl. Math. 232: 1–258.
  • Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S. M. (2020). Outer independent double Roman domination. Appl. Math. Comput. 364: 124617.
  • Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S. M., Valenzuela-Tripodoro, J. C. (2022). Maximal double Roman domination in graphs. Appl. Math. Comput. 414: 126662.
  • Abdollahzadeh Ahangar, H., Amjadi, J., Chellali, M., Nazari-Moghaddam, S., Sheikholeslami, S. M. (2019). Trees with double Roman domination number twice the domination number plus two. Iran. J. Sci. Technol. Trans. Sci. 43(3): 1081–1088.
  • Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S. M., Volkmann, L. (2018). An upper bound on the double Roman domination number. J. Comb. Optim. 36(1): 81–89.
  • Beeler, R. A., Haynes, T. W., Hedetniemi, S. T. (2016). Double Roman domination. Discrete Appl. Math. 211: 23–29.
  • Hao, G., Volkmann, L., Mojdeh, D. A. (2020). Total double Roman domination in graphs. Commun. Comb. Optim. 5: 27–39.
  • Khoeilar, R., Chellali, M., Karami, H., Sheikholeslami, S. M. (2019). An improved upper bound on the double Roman domination number of graphs with minimum degree at least two. Discrete Appl. Math. 270: 159–167.
  • Kosari, S., Shao, Z., Sheikholeslami, S. M., Chellali, M., Khoeilar, R., Karami, H. (2022). Double Roman domination in graphs with minimum degree at least two and no C5-cycle. Graphs Combin. 38: 39.
  • Ma, D.-X, Chen, X.-G. (2004). A note on connected bipartite graphs having independent domination number half their order. Appl. Math. Lett. 17(8): 959–962.
  • Maimani, H. R., Momeni, M., Nazari-Moghaddam, S., Rahimi Mahid, F., Sheikholeslami, S. M. (2020). Independent double Roman domination in graphs. Bull. Iran. Math. Soc. 46(2): 543–555.
  • Maimani, H. R., Momeni, M., Rahimi Mahid, F., Sheikholeslami, S. M. (2020). Independent double Roman domination in graphs. AKCE Int. J. Graphs Combin. 17(3): 905–910.
  • Mojdeh, D. A., Mansouri, Z. (2020). On the independent double Roman domination in graphs. Bull. Iran. Math. Soc. 46(4): 905–915.
  • Teymourzadeh, A., Mojdeh, D. A. (in press). Covering total double Roman domination in graphs. Commun. Comb. Optim.
  • Volkmann, L. (2018). Double Roman domination and domatic numbers of graphs. Commun. Comb. Optim. 3: 71–77.
  • Zhang, X., Li, Z., Jiang, H., Shao, Z. (2018). Double Roman domination in trees. Info. Prcess. Lett. 134: 31–34.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.