Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
From MaRDI portal
Publication:5235366
Recommendations
- Zero forcing and maximum nullity for hypergraphs
- On the relationships between zero forcing numbers and certain graph coverings
- Zero forcing sets and the minimum rank of graphs
- Zero forcing sets and bipartite circulants
- On zero forcing number of graphs and their complements
- Hypergraphs and proper forcing
- On extremal graphs for zero forcing number
- Zero forcing in iterated line digraphs
- Decompositions and forcing relations in graphs and other combinatorial structures
- Some bounds on the zero forcing number of a graph
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1531076 (Why is no real title available?)
- scientific article; zbMATH DE number 1924164 (Why is no real title available?)
- Color hypergroup and join space obtained by the vertex coloring of a graph
- Degree hypergroupoids associated with hypergraphs
- Diffusion processes on graphs and the averaging principle
- Dynamical Processes on Complex Networks
- Path hypergroupoids: commutativity and graph connectivity.
- Polygroup theory and related systems.
- The path hyperoperation
- Zero forcing sets and the minimum rank of graphs
- \(k\)-forcing number for Cartesian product of some graphs
Cited in
(3)
This page was built for publication: Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235366)
