Some algebraic hyperstructures related to zero forcing sets and forcing digraphs

DOI10.1142/S0219498819501925zbMath1421.05043OpenAlexW2898588842WikidataQ129024161 ScholiaQ129024161MaRDI QIDQ5235366

Masoumeh Golmohamadian, M. M. Zahedi, Nasrin Soltankhah

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

zbMATH Keywords

hypergroupzero forcing setzero forcing processjoin spaceforcing Digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Hypergroups (20N20)

Related Items (2)

Unnamed Item ⋮ The language of epidemic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path hypergroupoids: commutativity and graph connectivity.
• Diffusion processes on graphs and the averaging principle
• Zero forcing sets and the minimum rank of graphs
• Degree hypergroupoids associated with hypergraphs
• Dynamical Processes on Complex Networks
• Polygroup Theory and Related Systems
• k-Forcing number for Cartesian product of some graphs
• Color hypergroup and join space obtained by the vertex coloring of a graph

This page was built for publication: Some algebraic hyperstructures related to zero forcing sets and forcing digraphs