The zero forcing number of claw-free cubic graphs
- 24 August 2024
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 321-330
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Shandong Province (ZR2019MA012, ZR2022MA077)
This publication has 31 references indexed in Scilit:
- On the Relationship Between the Zero Forcing Number and Path Cover Number for Some GraphsBulletin of the Iranian Mathematical Society, 2020
- Zero Forcing in Claw-Free Cubic GraphsBulletin of the Malaysian Mathematical Sciences Society, 2020
- Zero Forcing in triangulationsJournal of Computational and Applied Mathematics, 2019
- Bounds on the Connected Forcing Number of a GraphGraphs and Combinatorics, 2018
- Total Forcing and Zero Forcing in Claw-Free Cubic GraphsGraphs and Combinatorics, 2018
- 2-Factors in claw-free graphs with locally disconnected verticesCzechoslovak Mathematical Journal, 2015
- Upper bounds on the-forcing number of a graphDiscrete Applied Mathematics, 2015
- Logic circuits from zero forcingNatural Computing, 2014
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a GraphJournal of Graph Theory, 2012
- Spanning trees with many leavesJournal of Mathematical Sciences, 2011