Propagation time for probabilistic zero forcing (Q5090539): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination in graphs with bounded propagation: Algorithms, formulations and hardness results / 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: Upper bounds on the \(k\)-forcing number of a graph / 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: Q5374237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throttling for the game of cops and robbers on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622244 / 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: Iteration Index of a Zero Forcing Set in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Zero Forcing Number of Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic zero forcing on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the runtime and robustness of randomized broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest-path problem for graphs with random arc-lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / 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: The Zero Forcing Number of 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: Randomized Rumour Spreading: The Effect of the Network Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite propagation time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank

Latest revision as of 16:16, 29 July 2024

scientific article; zbMATH DE number 7560310
Language Label Description Also known as
English
Propagation time for probabilistic zero forcing
scientific article; zbMATH DE number 7560310

    Statements

    20 July 2022
    0 references
    discrete dynamical system
    0 references
    propagation time
    0 references
    0 references
    0 references
    math.CO
    0 references
    cs.DM
    0 references

    Identifiers