Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 55, 2021
|
|
|---|---|---|
| Article Number | 11 | |
| Number of page(s) | 11 | |
| DOI | https://doi.org/10.1051/ita/2021012 | |
| Published online | 28 October 2021 | |
- A. Brandstädt, V.D. Chepoi and F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82 (1995) 43–77. [CrossRef] [MathSciNet] [Google Scholar]
- E.J. Cockayne, P.J.P. Grobler, W.R. Grundlingh, J. Munganga and J.H. Van Vuuren, Protection of a graph. Util. Math. 67 (2005) 19–32. [MathSciNet] [Google Scholar]
- B. Chaluvaraju, M. Chellali and K.A. Vidya, Perfect k-domination in graphs. Austr. J. Comb. 48 (2010) 175–184. [Google Scholar]
- B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85 (1990) 12–75. [Google Scholar]
- F.F. Dragan, K.F. Prisakar and V.D. Chepoi, Location problems in graphs and the Helly property (in Russian). Diskr. Mat. 4 (1992) 67–73. [Google Scholar]
- M.R. Garey and D.S. Johnson, Computers and Interactability: A Guide to the Theory of NP-completeness. Freeman, New York (1979). [Google Scholar]
- T.W. Haynes, S. Hedetniemi and P. Slater, Domination in graphs: advanced topics. Marcel Dekker (1997). [Google Scholar]
- M.A. Henning and A. Pandey, Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766 (2019) 46–57. [CrossRef] [Google Scholar]
- W.F. Klostermeyer and C.M. Mynhardt, Secure domination and secure total domination in graphs. Discuss. Math. Graph Theory. 28 (2008) 267–284. [CrossRef] [MathSciNet] [Google Scholar]
- M. Lin and C. Chen, Counting independent sets in tree convex bipartite graphs. Discr. Appl. Math. 218 (2017) 113–122. [CrossRef] [Google Scholar]
- N. Mahadev and U. Peled, Threshold Graphs and Related Topics. Elsevier (1995). [Google Scholar]
- H.B. Merouane and M. Chellali, On secure domination in graphs. Inf. Process. Lett. 115 (2015) 786–790. [CrossRef] [Google Scholar]
- C.M. Mynhardt, H.C. Swart and L. Ungerer, Excellent trees and secure domination. Util. Math. 67 (2005) 255–267. [MathSciNet] [Google Scholar]
- A. Oganian and D. Josep, On the complexity of optimal microaggregation for statistical disclosure control. Stat. J. United Nations Economic Commission for Europe 18 (2001) 345–353. [CrossRef] [Google Scholar]
- B.S. Panda and A. Pandey, Algorithm and hardness results for outer-connected dominating set in graphs. J. Graph Algor. Appl. 18 (2014) 493–513. [CrossRef] [Google Scholar]
- S.V.D. Rashmi, S. Arumugam, K.R. Bhutani and P. Gartland, Perfect secure domination in graphs. Categ. General Algebr. Struct. Appl. 7 (2017) 125–140. [MathSciNet] [Google Scholar]
- P.M. Weichsel, Dominating sets in n-cubes. J. Graph Theory 18 (1994) 479–488. [CrossRef] [MathSciNet] [Google Scholar]
- D.B. West, Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.