On minimum rank and zero forcing sets of a graph (Q967512): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1016/j.laa.2010.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101639990 / 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: Computation of minimal rank and path cover number for certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic and unicyclic graphs whose minimum rank equals the diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum rank of not necessarily symmetric matrices: A preliminary study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose minimal rank is two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose minimal rank is two: The finite fields case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank problem over the finite field of order 2: Minimum rank 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3559048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eigenvalue problems for Jacobi matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations, minimum rank, and graph complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum corank of graphs with a 2-separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-connected graphs whose maximum nullity is at most three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank

Latest revision as of 19:31, 2 July 2024

scientific article
Language Label Description Also known as
English
On minimum rank and zero forcing sets of a graph
scientific article

    Statements

    On minimum rank and zero forcing sets of a graph (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2010
    0 references
    0 references
    minimum rank
    0 references
    maximum nullity
    0 references
    rank
    0 references
    symmetric matrix
    0 references
    zero forcing set
    0 references
    block-clique graph
    0 references
    unit interval graph
    0 references
    product graph
    0 references
    0 references