The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grundy domination and zero forcing in Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a \(q\)-analogue of zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using variants of zero forcing to bound the inertia set of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the zero forcing number of a graph involving some classical parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree maximal graphs are Laplacian integral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite maximum nullity and zero forcing number / rank
 
Normal rank

Latest revision as of 10:20, 29 August 2024

scientific article; zbMATH DE number 7825792
Language Label Description Also known as
English
The \(q\)-analogue of zero forcing for certain families of graphs
scientific article; zbMATH DE number 7825792

    Statements

    The \(q\)-analogue of zero forcing for certain families of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2024
    0 references
    zero forcing
    0 references
    variants of zero forcing
    0 references
    trees
    0 references
    threshold graphs
    0 references
    Kneser graph
    0 references
    Cartesian product
    0 references
    maximum nullity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references