Complementary Vanishing Graphs

DOI10.1016/J.LAA.2024.03.030MaRDI QIDQ6405051zbMATH OpenFDO

Authors Craig Erickson, Luyining Gan, Jürgen Kritschgau, Jephian Chin-Hung Lin, Sam Spiro

Publication date 15 July 2022

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

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) Numerical solutions to inverse eigenvalue problems (65F18)

Abstract: Given a graph $G$ with vertices $v_1,ldots,v_n$, we define $mathcalS(G)$ to be the set of symmetric matrices $A=[a_{i,j}]$ such that for $iej$ we have $a_{i,j}e0$ if and only if $v_i{v}_{j}inE(G)$. Motivated by the Graph Complement Conjecture, we say that a graph $G$ is complementary vanishing if there exist matrices $AinmathcalS(G)$ and $BinmathcalS(overlineG)$ such that $AB=O$. We provide combinatorial conditions for when a graph is or is not complementary vanishing, and we characterize which graphs are complementary vanishing in terms of certain minimal complementary vanishing graphs. In addition to this, we determine which graphs on at most $8$ vertices are complementary vanishing.

Recommendations

• Complementary eigenvalues of graphs
• scientific article; zbMATH DE number 459300
• On completely positive graphs and their complements
• The combinatorial inverse eigenvalue problem. II: All cases for small graphs

This page was built for publication: Complementary Vanishing Graphs

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