On extremal graphs for zero forcing number

DOI10.1007/s00373-022-02591-yOpenAlexW4308404894MaRDI QIDQ2102756

Yi-Ping Liang, Jian Xi Li, Shou-Jun Xu

Publication date: 29 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02591-y

zbMATH Keywords

girthtriangle-free graphsubcubic graphzero forcing numberconnected forcing number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Proof of a conjecture on the zero forcing number of a graph
• Extremal values and bounds for the zero forcing number
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Upper bounds on the \(k\)-forcing number of a graph
• Maximum nullity and zero forcing number on graphs with maximum degree at most three
• On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
• Orthogonal representations, minimum rank, and graph complements
• An upper bound for the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Lower bounds in minimum rank problems
• Non-separating induced cycles in graphs
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Some bounds on the zero forcing number of a graph
• On the total forcing number of a graph
• Bounds on the connected forcing number of a graph
• Approximating the minimum rank of a graph via alternating projection
• Computation of minimal rank and path cover number for certain graphs
• Logic circuits from zero forcing
• Complexity and computation of connected zero forcing
• Blocking zero forcing processes in Cartesian products of graphs
• On the zero forcing number of a graph involving some classical parameters
• Zero forcing sets and the minimum rank of graphs
• Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
• The graphs for which the maximum multiplicity of an eigenvalue is two
• On the nullity of graphs
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• Graphs whose minimal rank is two
• Bounds for the Zero Forcing Number of Graphs with Large Girth

This page was built for publication: On extremal graphs for zero forcing number