Throttling positive semidefinite zero forcing propagation time on graphs (Q1720308): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866604 / 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: Nondiscriminatory propagation on trees / 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 03:57, 18 July 2024

scientific article
Language Label Description Also known as
English
Throttling positive semidefinite zero forcing propagation time on graphs
scientific article

    Statements

    Throttling positive semidefinite zero forcing propagation time on graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    0 references
    zero forcing
    0 references
    propagation time
    0 references
    throttling
    0 references
    positive semidefinite
    0 references
    0 references
    0 references