On the relationships between zero forcing numbers and certain graph coverings (Q2017194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1311.7064 / 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: Minimum rank, maximum nullity and zero forcing number for selected graph families / 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: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between the maximum multiplicity and path cover number for tree-like graphs / 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: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / 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: 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: The graphs for which the maximum multiplicity of an eigenvalue is two / 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: Zero forcing number, path cover number, and maximum nullity of cacti / 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

Latest revision as of 15:54, 8 July 2024

scientific article
Language Label Description Also known as
English
On the relationships between zero forcing numbers and certain graph coverings
scientific article

    Statements

    On the relationships between zero forcing numbers and certain graph coverings (English)
    0 references
    0 references
    0 references
    25 June 2014
    0 references
    zero forcing number
    0 references
    positive zero forcing number
    0 references
    path cover number
    0 references
    tree cover number
    0 references

    Identifiers

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