Minimum semidefinite rank of signed graphs and partial 3-trees

DOI10.1016/J.LAA.2025.02.018MaRDI QIDQ7018123zbMATH OpenFDO

Authors Ansam I. Al-Aqtash, Lon H. Mitchell, S. K. Narayan

Publication date 5 March 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.02.018

zbMATH Keywords

minimum semidefinite rankpartial 3-treessign pattern matrixsigned cyclessigned graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35) Hermitian, skew-Hermitian, and related matrices (15B57)

Cites work

• A new lower bound for the positive semidefinite minimum rank of a graph
• A note on the positive semidefinite minimum rank of a sign pattern matrix
• A note on vector representation of graphs
• A partial k-arboretum of graphs with bounded treewidth
• Graph theory
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• Lower bounds in minimum rank problems
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the minimum semidefinite rank of a simple graph
• On the minimum semidefinite rank of signed graphs
• Zero forcing parameters and minimum rank problems

This page was built for publication: Minimum semidefinite rank of signed graphs and partial 3-trees

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