The forcing number of graphs with given girth
From MaRDI portal
Publication:4639236
DOI10.2989/16073606.2017.1376230zbMath1385.05060arXiv1610.08435OpenAlexW2963622569MaRDI QIDQ4639236
Michael A. Henning, Randy Davila
Publication date: 3 May 2018
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08435
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Total forcing sets and zero forcing sets in trees ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ On the total forcing number of a graph ⋮ Bounds on the connected forcing number of a graph ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ A short proof for a lower bound on the zero forcing number ⋮ Matching, path covers, and total forcing sets ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees
Cites Work
- Extremal values and bounds for the zero forcing number
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Girth and treewidth
- Some bounds on the zero forcing number of a graph
- Logic circuits from zero forcing
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Extremal graphs without three‐cycles or four‐cycles
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Total Domination in Graphs
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
This page was built for publication: The forcing number of graphs with given girth
