Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
DOI10.1142/S0219498819501925zbMATH Open1421.05043OpenAlexW2898588842WikidataQ129024161 ScholiaQ129024161MaRDI QIDQ5235366FDOQ5235366
M. Golmohamadian, Nasrin Soltankhah, M. M. Zahedi
Publication date: 10 October 2019
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498819501925
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Hypergroups (20N20)
Cites Work
- Diffusion processes on graphs and the averaging principle
- Zero forcing sets and the minimum rank of graphs
- Polygroup Theory and Related Systems
- Title not available (Why is that?)
- Dynamical Processes on Complex Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Path hypergroupoids: commutativity and graph connectivity.
- Title not available (Why is that?)
- Color hypergroup and join space obtained by the vertex coloring of a graph
- Degree hypergroupoids associated with hypergraphs
- k-Forcing number for Cartesian product of some graphs
Cited In (2)
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)
