Computation of minimal rank and path cover number for certain graphs
type: Item
instance of: scholarly article
title: Computation of minimal rank and path cover number for certain graphs
zbMATH Open document ID: 1052.05045
author: Leslie Hogben
author: Francesco Barioli
author: Shaun M. Fallat
published in: Linear Algebra and its Applications
publication date: 2004-11-26T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 2119139
zbMATH Keywords: Graphs
zbMATH Keywords: Minimum rank
zbMATH Keywords: Path cover number
zbMATH Keywords: Symmetric matrices
zbMATH Keywords: Vertex sum
zbMATH Keywords: Edge sum
MaRDI profile type: Publication
full work available at URL: j.laa.2004.06.019
OpenAlex ID: W1988353915
cites work: On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
cites work: On the eigenvalues of generalized and double generalized stars
cites work: Graphs whose minimal rank is two
cites work: A characterization of tridiagonal matrices
cites work: On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
cites work: On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
cites work: Minimum-rank matrices with prescribed graph
cites work: On the Eigenvalues and Eigenvectors of a Class of Matrices
cites work: Spectral multiplicity and splitting results for a class of qualitative matrices
cites work: A typical vertex of a tree
DOI: 10.1016/J.LAA.2004.06.019
description: scientific article; zbMATH DE number 2119139