Zero forcing and maximum nullity for hypergraphs (Q2185737): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2995207248 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.09908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum rank of skew-symmetric matrices described by a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5374237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infection in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph theory. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \({k}\)-power domination of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum rank with zero diagonal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional zero forcing via three-color forcing games / rank
 
Normal rank

Latest revision as of 20:34, 22 July 2024

scientific article
Language Label Description Also known as
English
Zero forcing and maximum nullity for hypergraphs
scientific article

    Statements

    Zero forcing and maximum nullity for hypergraphs (English)
    0 references
    0 references
    5 June 2020
    0 references
    The concept of zero forcing and of (maximum) nullity is well-known in the context of graphs. It is defined using the adjacency matrix of a graph, a very natural and well-known construction. The author generalizes these notions to (uniform) hypergraphs and uses hypercubical hypermatrices for this purpose -- a construction that generalizes adjacency matrices. After introducing zero forcing and maximum nullity for uniform hypergraphs, the author shows that the former is an upper bound for the latter. Further results compare these new concepts to the infection number of a hypergraph and the iteration process in hypergraph dominations.
    0 references
    zero forcing
    0 references
    hypergraph
    0 references
    maximum nullity
    0 references
    hypermatrix
    0 references
    infection number
    0 references
    power domination
    0 references

    Identifiers