On the length of L-Grundy sequences
From MaRDI portal
Publication:2172087
DOI10.1016/j.disopt.2022.100725zbMath1506.05159arXiv2108.12264OpenAlexW3197285983MaRDI QIDQ2172087
Stephen G. Z. Smith, Rebekah Herrman
Publication date: 15 September 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.12264
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Total dominating sequences in graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Dominating sequences in graphs
- Grundy dominating sequences on \(X\)-join product
- Grundy domination of forests and the strong product conjecture
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- 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
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- Restricted power domination and zero forcing problems
- Zero forcing sets and the minimum rank of graphs
- On the L-Grundy domination number of a graph
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
This page was built for publication: On the length of L-Grundy sequences
