Secure domination and secure total domination in graphs

Article Properties
Cite
Klostermeyer, William F., and Christina M. Mynhardt. “Secure Domination and Secure Total Domination in Graphs”. Discussiones Mathematicae Graph Theory, vol. 28, no. 2, 2008, p. 267, https://doi.org/10.7151/dmgt.1405.
Klostermeyer, W. F., & Mynhardt, C. M. (2008). Secure domination and secure total domination in graphs. Discussiones Mathematicae Graph Theory, 28(2), 267. https://doi.org/10.7151/dmgt.1405
Klostermeyer WF, Mynhardt CM. Secure domination and secure total domination in graphs. Discussiones Mathematicae Graph Theory. 2008;28(2):267.
Journal Category
Science
Mathematics
Citations
Title Journal Journal Categories Citations Publication Date
Secure total domination number in maximal outerplanar graphs Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
2024
On the complexity of co-secure dominating set problem Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2024
Some new algorithmic results on co-secure domination in graphs Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2024
Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
2023
Secure domination of some graph operators Indian Journal of Pure and Applied Mathematics
  • Science: Mathematics
2022
Citations Analysis
The category Science: Mathematics 21 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Secure domination critical graphs and was published in 2009. The most recent citation comes from a 2024 study titled Secure total domination number in maximal outerplanar graphs. This article reached its peak citation in 2020, with 6 citations. It has been cited in 16 different journals, 18% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 7 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year