Brushing number and zero-forcing number of graphs and their line graphs
From MaRDI portal
Publication:1756097
DOI10.1007/s00373-018-1964-yzbMath1404.05207arXiv1609.05854OpenAlexW3104253731MaRDI QIDQ1756097
Karen Meagher, Aras Erzurumluoğlu, David A. Pike
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.05854
Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Game brush number
- Fast-mixed searching and related problems on graphs
- Brush your trees!
- Cleaning a network with brushes
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Clean the graph before you draw it!
- Some bounds on the zero forcing number of a graph
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- Critical ideals, minimum rank and zero forcing number
- Brushing without capacity restrictions
- Zero forcing sets and the minimum rank of graphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Line graphs: Their maximum nullities and zero forcing numbers
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Cleaning Regular Graphs with Brushes
- On the complexity of the positive semidefinite zero forcing number
