Uniformly sparse graphs and matrices

DOI10.2140/INVOLVE.2024.17.249MaRDI QIDQ6543062zbMATH OpenFDO

Authors C. Richard jun. Johnson, Wenxuan Ding, Yuqiao Li

Publication date 24 May 2024

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/INVOLVE.2024.17.249

zbMATH Keywords

diagonal equivalencedirected graphminimum rankpath cover numbertreeuniformly sparse matrixzero forcing number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
• On the rank spread of graphs
• Algebraic characterization of strongly connected graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• scientific article; zbMATH DE number 3923468

Cites work

• A zero forcing technique for bounding sums of eigenvalue multiplicities
• Eigenvalues, multiplicities and graphs
• Geometric Parter-Wiener, etc. theory
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Minimum rank problems
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the zero forcing number and spectral radius of graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Schur complement and its applications
• The Term Rank of a Matrix
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(1)

• Sparks of symmetric matrices and their graphs

This page was built for publication: Uniformly sparse graphs and matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543062)