Graph complement conjecture for classes of shadow graphs
From MaRDI portal
Publication:5862842
DOI10.7153/oam-2021-15-40zbMath1482.05194OpenAlexW3176683134WikidataQ123135445 ScholiaQ123135445MaRDI QIDQ5862842
Monsikarn Jansrang, Sivaram K. Narayan
Publication date: 10 March 2022
Published in: Operators and Matrices (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7153/oam-2021-15-40
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Unnamed Item
- Unnamed Item
- On the graph complement conjecture for minimum rank
- On the graph complement conjecture for minimum semidefinite rank
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Linearly independent vertices and minimum semidefinite rank
- Orthogonal representations, minimum rank, and graph complements
- Zero forcing parameters and minimum rank problems
- Graphs whose positive semi-definite matrices have nullity at most two
- Multiplicities of eigenvalues and tree-width of graphs
- Zero forcing sets and the minimum rank of graphs
- Handbook of Graph Theory
- On the minimum semidefinite rank of a simple graph
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- Graph Classes: A Survey
- A survey of graph laplacians
This page was built for publication: Graph complement conjecture for classes of shadow graphs