A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2011.05.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974753353 / 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: Zero forcing parameters and minimum rank problems / 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: On the difference between the maximum multiplicity and path cover number for tree-like graphs / 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: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum rank problems / 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: Nondiscriminatory propagation on trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:35, 5 July 2024

scientific article
Language Label Description Also known as
English
A technique for computing the zero forcing number of a graph with a cut-vertex
scientific article

    Statements

    Identifiers