On the complexity of the positive semidefinite zero forcing number (Q5962481): 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: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fast Searching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly independent vertices and minimum semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional intersection number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum rank and zero forcing sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank

Latest revision as of 10:17, 11 July 2024

scientific article; zbMATH DE number 6541262
Language Label Description Also known as
English
On the complexity of the positive semidefinite zero forcing number
scientific article; zbMATH DE number 6541262

    Statements

    On the complexity of the positive semidefinite zero forcing number (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2016
    0 references
    positive zero forcing number
    0 references
    clique cover number
    0 references
    chordal graphs
    0 references
    computational complexity
    0 references

    Identifiers

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