On acyclic and unicyclic graphs whose minimum rank equals the diameter

DOI10.1016/j.laa.2008.04.031zbMath1145.05036OpenAlexW2036495097MaRDI QIDQ947619

Ronald L. Smith, Shaun M. Fallat, Francesco Barioli

Publication date: 6 October 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.04.031

zbMATH Keywords

diameterunicyclic graphpath coveracyclic graphminimum rankmaximum multiplicity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (3)

Acyclic matrices with a small number of distinct eigenvalues ⋮ Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree ⋮ On minimum rank and zero forcing sets of a graph

Cites Work

• On the minimum rank of the join of graphs and decomposable graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• On the rank of a matrix associated with a graph.
• Computation of minimal rank and path cover number for certain graphs
• Minimum-rank matrices with prescribed graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Graphs whose minimal rank is two
• Spectral graph theory and the inverse eigenvalue problem of a graph

This page was built for publication: On acyclic and unicyclic graphs whose minimum rank equals the diameter