On acyclic and unicyclic graphs whose minimum rank equals the diameter
Authors:
- Francesco BarioliFBFrancesco Barioli
- Shaun M. FallatSFShaun M. Fallat
- Ronald L. SmithRSRonald L. Smith
- 1 October 2008
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 429 (7) , 1568-1578
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The minimum rank of symmetric matrices described by a graph: A surveyLinear Algebra and its Applications, 2007
- On the minimum rank of the join of graphs and decomposable graphsLinear Algebra and its Applications, 2007
- Spectral graph theory and the inverse eigenvalue problem of a graphThe Electronic Journal of Linear Algebra, 2005
- On the difference between the maximum multiplicity and path cover number for tree-like graphsLinear Algebra and its Applications, 2004
- Computation of minimal rank and path cover number for certain graphsLinear Algebra and its Applications, 2004
- Graphs whose minimal rank is twoThe Electronic Journal of Linear Algebra, 2004
- On the rank of a matrix associated with a graphDiscrete Mathematics, 2003
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a treeLinear and Multilinear Algebra, 1999
- Minimum-rank matrices with prescribed graphLinear Algebra and its Applications, 1996