Maximum nullity of outerplanar graphs and the path cover number (Q848586): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 the difference between the maximum multiplicity and path cover number for tree-like graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of tridiagonal matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum-rank matrices with prescribed graph / 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 |
Latest revision as of 13:02, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum nullity of outerplanar graphs and the path cover number |
scientific article |
Statements
Maximum nullity of outerplanar graphs and the path cover number (English)
0 references
4 March 2010
0 references
minimum rank
0 references
graph
0 references
path cover number
0 references
outerplanar
0 references
partial 2-path
0 references
symmetric
0 references
0 references