On graphs all of whose total dominating sequences have the same length
From MaRDI portal
Publication:2037571
DOI10.1016/j.disc.2021.112492zbMath1467.05183OpenAlexW3169633435MaRDI QIDQ2037571
Oğuz Doğan, Didem Gözüpek, Selim Bahadır
Publication date: 8 July 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112492
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Total dominating sequences in graphs
- Dominating sequences in grid-like and toroidal graphs
- Dominating sequences in graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Grundy dominating sequences and zero forcing sets
- On Grundy total domination number in product graphs
- Uniform length dominating sequence graphs
- Well-totally-dominated graphs
- Total domination in graphs
- Total Domination in Graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On graphs all of whose total dominating sequences have the same length