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

Quasi-total Roman bondage number in graphs

Huiqin JiangInstitute of Computing Science and Technology, Guangzhou University, Guangzhou, ChinaView further author information
&
Zehui ShaoInstitute of Computing Science and Technology, Guangzhou University, Guangzhou, ChinaCorrespondence[email protected]
View further author information
Pages 221-228 | Received 25 Jan 2022, Accepted 23 Jun 2022, Published online: 19 Sep 2022

References

  • Cabrera-García, S., Cabrera-Martínez, A., Yero, I. G. (2019). Quasi-total Roman domination in graphs. Results Math. 74(4): 173.
  • Cabrera-Martínez, A., Martinez Arias, A., Castillo, M. M. (2021). A characterization relating domination, semitotal domination and total Roman domination in trees. Commun. Comb. Optim. 6: 197–209.
  • Cabrera Martínez, A., Hernández-Gómez, J. C., Sigarreta, J. M. (2021). On the quasi-total Roman domination number of graphs. Mathematics 9(21): 2823.
  • Chakradhar, P., Venkata Subba Reddy, P. (2022). Algorithmic aspects of total Roman {2}-domination in graphs. Commun. Comb. Optim 7: 183–192.
  • Chellali, M., Jafari Rad, N., Sheikholeslami, S. M., Volkmann, L. (2020). Roman domination in graphs. In: Haynes, T.W., Hedetniemi, S. T., Henning, M.A., eds. Topics in Domination in Graphs. Berlin/Heidelberg: Springer, pp. 365–409.
  • Chellali, M., Jafari Rad, N., Sheikholeslami, S. M., Volkmann, L. (2021). Varieties of Roman domination. In: Haynes, T.W., Hedetniemi, S. T., Henning, M.A., eds. Structures of Domination in Graphs. Berlin/Heidelberg: Springer, pp. 273–307.
  • Chellali, M., Jafari Rad, N., Sheikholeslami, S. M., Volkmann, L. (2020). Varieties of Roman domination II. AKCE Int. J. Graphs Comb. 17(3): 966–984.
  • Chellali, M., Jafari Rad, N., Sheikholeslami, S. M., Volkmann, L. (2020). A survey on Roman domination parameters in directed graphs. J. Combin. Math. Combin. Comput. 115: 141–171.
  • Cockayne, E. J., Dreyer, P. A., Hedetniemi, S. M., Hedetniemi, S. T. (2004). Roman domination in graphs. Discrete Math 278(1-3): 11–22.
  • Fink, J. F., Jacobson, M. S., Kinch, L. F., Roberts, J. (1990). The bondage number of a graph. Discrete Math 86(1-3): 47–57.
  • Garey, M. R., Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completness. San Francisco, CA: Freeman.
  • Liu, C.-H., Chang, G. J. (2013). Roman domination on strongly chordal graphs. J. Comb. Optim. 26(3): 608–619.
  • Mangal, V., Venkata Subba Reddy, P. (2022). Algorithmic aspects of quasi-total Roman domination in graphs. Commun. Comb. Optim. 7: 93–104.
  • Sridharan, N., Elias, M. D., Subramanian, V. S. A. (2007). Total bondage number of a graph. AKCE Int. J. Graphs. Combin. 4: 203–209.

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.