Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902): 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: Minimum semidefinite rank of outerplanar graphs and the tree cover number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for minimum semidefinite rank from superpositions and cutsets / 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: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph / 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: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed cliques graphs, clique coverings and positive zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs: Their maximum nullities and zero forcing numbers / 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: On minimum rank and zero forcing sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite maximum nullity and zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / 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: Positive semidefinite propagation time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast edge searching and fast searching on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for positive semidefinite zero forcing and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the positive semidefinite minimum rank of a graph / rank
 
Normal rank

Latest revision as of 05:28, 20 July 2024

scientific article
Language Label Description Also known as
English
Positive semidefinite zero forcing numbers of two classes of graphs
scientific article

    Statements

    Positive semidefinite zero forcing numbers of two classes of graphs (English)
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    positive semidefinite zero forcing number
    0 references
    zero forcing number
    0 references
    maximum positive semidefinite nullity
    0 references
    minimum rank
    0 references
    0 references

    Identifiers