The zero forcing number of graphs with the matching number and the cyclomatic number
From MaRDI portal
Publication:6172214
DOI10.1007/s00373-023-02664-6zbMath1518.05065OpenAlexW4381511294MaRDI QIDQ6172214
Yu Jing, Shengjin Ji, Wenqian Zhang
Publication date: 19 July 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02664-6
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
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
- On the relationship between the zero forcing number and path cover number for some graphs
- Minimum rank problems
- Spectral radius of graphs with given matching number
- Zero forcing parameters and minimum rank problems
- Some bounds on the zero forcing number of a graph
- The size of 3-uniform hypergraphs with given matching number and codegree
- A lower bound on the zero forcing number
- Logic circuits from zero forcing
- Maximizing the number of cliques in graphs with given matching number
- Total forcing sets and zero forcing sets in trees
- \(d\)-cluster-free sets with a given matching number
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Zero forcing in triangulations
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- The Zero Forcing Number of Graphs
- The forcing number of graphs with given girth
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- Bounds for the Zero Forcing Number of Graphs with Large Girth
This page was built for publication: The zero forcing number of graphs with the matching number and the cyclomatic number