Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013879552 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1903.08614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-forcing number 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: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total forcing and zero forcing in claw-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the connected forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum semidefinite rank of a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the zero forcing number of a graph / 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: Q4368728 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:06, 23 July 2024

scientific article
Language Label Description Also known as
English
Maximum nullity and zero forcing number on graphs with maximum degree at most three
scientific article

    Statements

    Identifiers

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