On graphs all of whose total dominating sequences have the same length
From MaRDI portal
Publication:2037571
Recommendations
Cites work
- scientific article; zbMATH DE number 1161341 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Dominating sequences in graphs
- Dominating sequences in grid-like and toroidal graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Grundy dominating sequences and zero forcing sets
- On Grundy total domination number in product graphs
- Total dominating sequences in graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Total domination in graphs
- Total domination in graphs
- Uniform length dominating sequence graphs
- Well-totally-dominated graphs
Cited in
(6)- Graphs with equal Grundy domination and independence number
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Uniform length dominating sequence graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- On graphs with equal total domination and Grundy total domination numbers
- Total dominating sequences in graphs
This page was built for publication: On graphs all of whose total dominating sequences have the same length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037571)