Dominating sequences in graphs
DOI10.1016/J.DISC.2014.07.016zbMATH Open1300.05210OpenAlexW2115943606MaRDI QIDQ740654FDOQ740654
Authors: Boštjan Brešar, T. Gologranc, Martin Milanič, Douglas F. Rall, Romeo Rizzi 
Publication date: 4 September 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.016
Recommendations
- scientific article; zbMATH DE number 68357
- Total dominating sequences in graphs
- Degree sequences of graphs and dominance order
- Dominator sequences in bipartite graphs
- scientific article; zbMATH DE number 1248188
- scientific article
- scientific article; zbMATH DE number 30758
- Dominating sequences in grid-like and toroidal graphs
- Dominating Functions and Graphs
- scientific article; zbMATH DE number 6863591
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Reducibility among Combinatorial Problems
- Title not available (Why is that?)
- Complement reducible graphs
- Domination game and an imagination strategy
- Title not available (Why is that?)
- Extremal problems for game domination number
- Realizations of the game domination number
- The splittance of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (34)
- Total dominating sequences in graphs
- Grundy domination and zero forcing in Kneser graphs
- Grundy domination of forests and the strong product conjecture
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- Degree sequences of graphs and dominance order
- Grundy domination and zero forcing in regular graphs
- Facets of the polytope of legal sequences
- On the L-Grundy domination number of a graph
- A new approach on locally checkable problems
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Computation of Grundy dominating sequences in (co-)bipartite graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- On Grundy total domination number in product graphs
- GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS
- An integer programming approach for solving a generalized version of the Grundy domination number
- On graphs all of whose total dominating sequences have the same length
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Graphs with equal Grundy domination and independence number
- Domination number of graphs with minimum degree five
- Uniform length dominating sequence graphs
- On the length of L-Grundy sequences
- Grundy dominating sequences on \(X\)-join product
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Dominating sequences in grid-like and toroidal graphs
- Zero forcing number, Grundy domination number, and their variants
- Dominator sequences in bipartite graphs
- Grundy dominating sequences and zero forcing sets
- Vertex sequences in graphs
- Title not available (Why is that?)
- Z-domination game
- How long can one bluff in the domination game?
- Computational aspects of double dominating sequences in graphs
- The variety of domination games
- Indicated domination game
This page was built for publication: Dominating sequences in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740654)
