Zero and total forcing dense graphs
From MaRDI portal
Cites work
- A short proof for a lower bound on the zero forcing number
- Bounds on the connected forcing number of a graph
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Locating-total domination in claw-free cubic graphs
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- On the total forcing number of a graph
- On the zero forcing number of a graph involving some classical parameters
- Positive semidefinite maximum nullity and zero forcing number
- Roman domination excellent graphs: trees
- The Inverse Eigenvalue Problem of a Graph, Zero Forcing, and Related Parameters
- Total domination in graphs
- Total forcing and zero forcing in claw-free cubic graphs
- Total forcing versus total domination in cubic graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Vertices contained in all or in no minimum total dominating set of a tree
- Vertices contained in every minimum dominating set of a tree
- Zero forcing and power domination for graph products
- Zero forcing in claw-free cubic graphs
- Zero forcing sets and the minimum rank of graphs
- Zero forcing versus domination in cubic graphs
This page was built for publication: Zero and total forcing dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985993)
