The minimum rank of universal adjacency matrices

DOI10.1016/j.laa.2012.05.033zbMath1252.05107arXiv1112.1718OpenAlexW1997126628WikidataQ112882197 ScholiaQ112882197MaRDI QIDQ448355

Yi-Zheng Fan, Shaun M. Fallat, Shahla Nasserasr, Karen Meagher, Bahman Ahmadi, Fatemeh Alinaghipour

Publication date: 6 September 2012

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

Full work available at URL: https://arxiv.org/abs/1112.1718

zbMATH Keywords

graphcycleadjacency matrixpathLaplacian matrixminimum universal rankuniversal adjacency matrix

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Commutativity of matrices (15A27) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs

Cites Work

• Unnamed Item
• Universal adjacency matrices with two eigenvalues
• The minimum rank of symmetric matrices described by a graph: a survey
• Laplacian matrices of graphs: A survey
• The Gewirtz graph: An exercise in the theory of graph spectra
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: The minimum rank of universal adjacency matrices