On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs

DOI10.1016/J.DAM.2024.08.006MaRDI QIDQ6633544zbMATH OpenFDO

Authors Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young

Publication date 6 November 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.08.006

zbMATH Keywords

automated conjecturingvertex cover numberzero forcing number

Mathematics Subject Classification ID

Computational methods for problems pertaining to combinatorics (05-08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• The zero forcing number of claw-free cubic graphs
• A lower bound on the zero forcing number
• On the relationship between the zero forcing number and path cover number for some graphs
• On a conjecture of Gentner and Rautenbach
• Zero forcing in claw-free cubic graphs

Cites work

• A Graph Reduction Step Preserving Element-Connectivity and Applications
• A lower bound on the zero forcing number
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• A short proof for a lower bound on the zero forcing number
• AutoGraphiX: a survey
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• Conjectures of TxGraffiti: independence, domination, and matchings
• Domination in Graphs Applied to Electric Power Networks
• Dynamic approach to k-forcing
• Extremal values and bounds for the zero forcing number
• Facet defining inequalities among graph invariants: The system graphedron
• Fast-mixed searching and related problems on graphs
• scientific article; zbMATH DE number 5909822 (Why is no real title available?)
• scientific article; zbMATH DE number 1264487 (Why is no real title available?)
• scientific article; zbMATH DE number 5037208 (Why is no real title available?)
• scientific article; zbMATH DE number 5037209 (Why is no real title available?)
• Minimum rank and zero forcing number for butterfly networks
• New results relating independence and matchings
• On conjectures of Graffiti
• Proof of a conjecture on the zero forcing number of a graph
• Some bounds on the zero forcing number of a graph
• Total forcing and zero forcing in claw-free cubic graphs
• Total forcing versus total domination in cubic graphs
• Upper bounds on the \(k\)-forcing number of a graph
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Zero forcing in claw-free cubic graphs
• Zero forcing in iterated line digraphs
• Zero forcing sets and the minimum rank of graphs
• Zero forcing versus domination in cubic graphs

Cited in

(1)

• Automated conjecturing with TxGraffiti

This page was built for publication: On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633544)