Vertex sequences in graphs
From MaRDI portal
Publication:5862692
DOI10.47443/dml.2021.s103zbMath1499.05464OpenAlexW4246556385MaRDI QIDQ5862692
Stephen T. Hedetniemi, Teresa W. Haynes
Publication date: 9 March 2022
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2021.s103
dominationirredundancevertex covergrid graphstotal dominationconnected dominationzero forcing numberdominating sequencesvertex sequences
Related Items (3)
Computational aspects of double dominating sequences in graphs ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ On the extremal Mostar indices of trees with a given segment sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total dominating sequences in graphs
- Total version of the domination game
- Dominating sequences in grid-like and toroidal graphs
- Dominating sequences in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Using maximality and minimality conditions to construct inequality chains
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- Zero forcing sets and the minimum rank of graphs
- Domination Game and an Imagination Strategy
- Properties of Hereditary Hypergraphs and Middle Graphs
- Domination in Graphs Applied to Electric Power Networks
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- The PMU Placement Problem
- Approximation Algorithms and Hardness for Domination with Propagation
- Approximation Algorithms and Hardness for Domination with Propagation
This page was built for publication: Vertex sequences in graphs
