Certified domination
From MaRDI portal
Publication:5154565
DOI10.1016/j.akcej.2018.09.004zbMath1473.05221arXiv1606.03257OpenAlexW3037635478WikidataQ129164574 ScholiaQ129164574MaRDI QIDQ5154565
Jerzy Topp, Radosław Ziemann, Magdalena Lemańska, Paweł Żyliński, Magda Dettlaff
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03257
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Connected certified domination edge critical and stable graphs ⋮ Graphs with equal domination and certified domination numbers ⋮ Algorithmic aspects of certified domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing connected bicritical graphs with edge-connectivity 2
- Total domination edge critical graphs with total domination number three and many dominating pairs
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- On graphs having domination number half their order
- Edge criticality in secure graph domination
- Well irredundant graphs
- A survey of Nordhaus-Gaddum type relations
- On graphs with disjoint dominating and 2-dominating sets
- Total outer-connected domination in trees
- A characterization of (γt,γ2)-trees
- On Complementary Graphs
- Vertex domination-critical graphs
- Towards a theory of domination in graphs
- Vertex domination‐critical graphs
This page was built for publication: Certified domination
