On the minimum semidefinite rank of signed graphs
From MaRDI portal
Publication:2133675
DOI10.1016/j.laa.2022.02.004zbMath1487.05108OpenAlexW4210499187WikidataQ114151880 ScholiaQ114151880MaRDI QIDQ2133675
Nancy Matar, Sivaram K. Narayan, Lon H. Mitchell
Publication date: 5 May 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2022.02.004
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Linearly independent vertices and minimum semidefinite rank
- Maximum induced trees in graphs
- A note on vector representation of graphs
- A new lower bound for the positive semidefinite minimum rank of a graph
- On the minimum semidefinite rank of a simple graph
- Graphs whose minimal rank is two
This page was built for publication: On the minimum semidefinite rank of signed graphs