Signed graphs with maximum nullity two

DOI10.1016/J.LAA.2023.06.016MaRDI QIDQ6168544zbMATH OpenFDO

Authors Marina Arav, F. Scott Dahlgren, Hein van der Holst

Publication date 9 August 2023

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

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

zbMATH Keywords

nullitysigned graphsymmetric

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Two-connected signed graphs with maximum nullity at most two
• Signed graphs with stable maximum nullity at most two
• On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
• Canonical-sign-compatibility of some signed graphs
• Star complements for \(\pm 2\) in signed graphs
• Signed graphs whose signed Colin de Verdière parameter is two
• The nullity of bicyclic signed graphs
• Spectra of signed graphs with two eigenvalues
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• On the multiplicity of as an A_()-eigenvalue of signed graphs with pendant vertices

Cites work

• A characterization of tridiagonal matrices
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Maximum nullity of outerplanar graphs and the path cover number
• On the inertia set of a signed tree with loops
• Signed graphs
• Signed graphs with stable maximum nullity at most two
• The graphs for which the maximum multiplicity of an eigenvalue is two
• The inertia set of a signed graph
• Two-connected signed graphs with maximum nullity at most two

Cited in

(7)

• Further results on the nullity of signed graphs
• Signed graphs with stable maximum nullity at most two
• Signed graphs with maximal index
• On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
• Two-connected signed graphs with maximum nullity at most two
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• Signed graphs whose signed Colin de Verdière parameter is two

This page was built for publication: Signed graphs with maximum nullity two

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