Uniformly sparse graphs and matrices
DOI10.2140/INVOLVE.2024.17.249zbMATH Open1540.05105MaRDI QIDQ6543062
Yuqiao Li, Wenxuan Ding, C. Richard jun. Johnson
Publication date: 24 May 2024
Published in: Involve (Search for Journal in Brave)
treedirected graphminimum rankzero forcing numberpath cover numberdiagonal equivalenceuniformly sparse matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)
Cites Work
- Title not available (Why is that?)
- Minimum rank problems
- Zero forcing parameters and minimum rank problems
- Geometric Parter-Wiener, etc. theory
- The Schur complement and its applications
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- On the zero forcing number and spectral radius of graphs
- Zero forcing sets and the minimum rank of graphs
- The Term Rank of a Matrix
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Eigenvalues, Multiplicities and Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On the Eigenvalues and Eigenvectors of a Class of Matrices
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)
