Graph complement conjecture for classes of shadow graphs

DOI10.7153/OAM-2021-15-40MaRDI QIDQ5862842zbMATH OpenOpenAlexWikidataFDO

Authors Monsikarn Jansrang, S. 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

zbMATH Keywords

minimum semidefinite rankgraph complement conjectureshadow graphs

Mathematics Subject Classification ID

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)

Recommendations

• On the graph complement conjecture for minimum rank
• Bounds on the sum of minimum semidefinite rank of a graph and its complement
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Bounds on minimum semidefinite rank of graphs
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph

Cites work

• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• A survey of graph laplacians
• Graph Classes: A Survey
• Graph theory
• Graphs whose positive semi-definite matrices have nullity at most two
• Handbook of graph theory
• Linearly independent vertices and minimum semidefinite rank
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Multiplicities of eigenvalues and tree-width of graphs
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the graph complement conjecture for minimum rank
• On the graph complement conjecture for minimum semidefinite rank
• On the minimum semidefinite rank of a simple graph
• Orthogonal representations, minimum rank, and graph complements
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(3)

• On the graph complement conjecture for minimum rank
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Bounds on the sum of minimum semidefinite rank of a graph and its complement

This page was built for publication: Graph complement conjecture for classes of shadow graphs

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