On the Zero Forcing Number of Bijection Graphs

DOI10.1007/978-3-319-29516-9_28zbMath1479.05304OpenAlexW2417144027MaRDI QIDQ2798245

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

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

zero forcing numberzero forcing setbijection graph

Mathematics Subject Classification ID

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

Related Items (1)

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs

This page was built for publication: On the Zero Forcing Number of Bijection Graphs