A characterization of Roman trees

Article Properties
Cite
Henning, Michael .A. “A Characterization of Roman Trees”. Discussiones Mathematicae Graph Theory, vol. 22, no. 2, 2002, p. 325, https://doi.org/10.7151/dmgt.1178.
Henning, M. .A. (2002). A characterization of Roman trees. Discussiones Mathematicae Graph Theory, 22(2), 325. https://doi.org/10.7151/dmgt.1178
Henning M .A. A characterization of Roman trees. Discussiones Mathematicae Graph Theory. 2002;22(2):325.
Journal Category
Science
Mathematics
Citations
Title Journal Journal Categories Citations Publication Date
Approximation algorithm for the minimum partial connected Roman dominating set problem Journal of Combinatorial Optimization
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Science: Mathematics
2024
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)

Mathematics
  • Science: Mathematics
  • Science: Mathematics
2 2022
A Survey on Characterizing Trees Using Domination Number

Mathematics
  • Science: Mathematics
  • Science: Mathematics
2022
Maximal first Zagreb index of trees with given Roman domination number

AIMS Mathematics 1 2022
Roman {k}-domination in trees and complexity results for some classes of graphs Journal of Combinatorial Optimization
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Science: Mathematics
1 2021
Citations Analysis
The category Science: Mathematics 33 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Defending the Roman Empire—A new strategy and was published in 2003. The most recent citation comes from a 2024 study titled Approximation algorithm for the minimum partial connected Roman dominating set problem. This article reached its peak citation in 2021, with 6 citations. It has been cited in 15 different journals, 20% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 11 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year