Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Discrete Applied Mathematics · 2022

Roman {3}-domination in graphs: Complexity and algorithms

Juhi Chaudhary, Dinabandhu Pradhan

Cited by 3Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

Chaudhary, J., & Pradhan, D. (2022). Roman {3}-domination in graphs: Complexity and algorithms. Discrete Applied Mathematics, 354, 301–325. https://doi.org/10.1016/j.dam.2022.09.017

MLA 9

Chaudhary, Juhi, and Dinabandhu Pradhan. “Roman {3}-domination in graphs: Complexity and algorithms.” Discrete Applied Mathematics, vol. 354, 2022, pp. 301–25, https://doi.org/10.1016/j.dam.2022.09.017.

Chicago

Chaudhary, Juhi, and Dinabandhu Pradhan. 2022. “Roman {3}-domination in graphs: Complexity and algorithms.” Discrete Applied Mathematics 354: 301–25. https://doi.org/10.1016/j.dam.2022.09.017.

Harvard

Chaudhary, J. and Pradhan, D. (2022) ‘Roman {3}-domination in graphs: Complexity and algorithms’, Discrete Applied Mathematics, 354, pp. 301–325. Available at: https://doi.org/10.1016/j.dam.2022.09.017.

BibTeX
@article{chaudhary2022roman,
  title = {{Roman \{3\}-domination in graphs: Complexity and algorithms}},
  author = {Chaudhary, Juhi and Pradhan, Dinabandhu},
  journal = {Discrete Applied Mathematics},
  volume = {354},
  pages = {301--325},
  year = {2022},
  doi = {10.1016/j.dam.2022.09.017}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers