Zero forcing with random sets (Q6204353): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4392337806 / 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: The zero forcing polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-forcing in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores and shells of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on probabilistic zero forcing on hypercubes and grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Markov chains to determine expected propagation time for probabilistic zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic zero forcing on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for probabilistic zero forcing / 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: Inverse Problems and Zero Forcing for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Zero Forcing in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on expected propagation time of probabilistic zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for computing the zero forcing number of a graph with a cut-vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 10:26, 29 August 2024

scientific article; zbMATH DE number 7825870
Language Label Description Also known as
English
Zero forcing with random sets
scientific article; zbMATH DE number 7825870

    Statements

    Zero forcing with random sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2024
    0 references
    random set zero forcing
    0 references
    zero forcing polynomial
    0 references
    random graphs
    0 references
    graph threshold
    0 references

    Identifiers

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