Lower bounds for positive semidefinite zero forcing and their applications (Q512866): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9936-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1061820890 / 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: 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: Monotonicity in graph searching / 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: Topology of series-parallel networks / 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: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bicoloring clique hypergraphs of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / 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: Strong-mixed searching and pathwidth / rank
 
Normal rank

Latest revision as of 12:52, 13 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for positive semidefinite zero forcing and their applications
scientific article

    Statements

    Lower bounds for positive semidefinite zero forcing and their applications (English)
    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    zero forcing number
    0 references
    minimum rank
    0 references
    tree cover number
    0 references
    positive semidefinite zero forcing number
    0 references
    maximum positive semidefinite nullity
    0 references
    0 references