Well-totally-dominated graphs
From MaRDI portal
Publication:3390049
DOI10.26493/1855-3974.2465.571zbMath1487.05190arXiv2010.02341OpenAlexW3133600063MaRDI QIDQ3390049
Tınaz Ekim, Selim Bahadır, Didem Gözüpek
Publication date: 24 March 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.02341
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Recognizing well-dominated graphs is coNP-complete ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ On graphs all of whose total dominating sequences have the same length
Cites Work
- Triangulations and equality in the domination chain
- On the computational complexity of upper total domination
- A revision and extension of results on 4-regular, 4-connected, claw-free graphs
- Well-dominated graphs without cycles of lengths 4 and 5
- Total domination in graphs
- WELL-COVERED GRAPHS: A SURVEY
- Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
- On a Class of Graphs with Large Total Domination Number
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Total Domination in Graphs
- Dual subimplicants of positive Boolean functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Well-totally-dominated graphs
