On the zero forcing number of bijection graphs

DOI10.1007/978-3-319-29516-9_28MaRDI QIDQ2798245zbMATH OpenOpenAlexFDO

Authors Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman

Publication date 4 April 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29516-9_28

zbMATH Keywords

bijection graphzero forcing numberzero forcing set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On Zero Forcing Number of Permutation Graphs
• The zero forcing number of graphs with the matching number and the cyclomatic number
• On zero forcing number of graphs and their complements
• Some bounds on the zero forcing number of a graph
• Computing the zero forcing number for generalized Petersen graphs

Cited in

(6)

• Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
• Reconfiguration graphs of zero forcing sets
• Proof of a conjecture on the zero forcing number of a graph
• On Zero Forcing Number of Permutation Graphs
• The Zero Forcing Number of Graphs
• Zero forcing sets and bipartite circulants

This page was built for publication: On the zero forcing number of bijection graphs

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