On the strong Arnol'd hypothesis and the connectivity of graphs

DOI10.13001/1081-3810.1394zbMATH Open1205.05153OpenAlexW280440090MaRDI QIDQ3075166FDOQ3075166

Hein van der Holst

Publication date: 10 February 2011

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223772

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The strong Arnold property for 4-connected flat graphs
• Signed graphs with stable maximum nullity at most two
• scientific article; zbMATH DE number 475583
• Using a new zero forcing process to guarantee the strong Arnold property
• On the null space of a Colin de Verdière matrix

zbMATH Keywords

graphstransversalitygraph minorsymmetric matricesplanarnullityouterplanar

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cited In (5)

• Signed graphs with stable maximum nullity at most two
• Title not available (Why is that?)
• On the null space of a Colin de Verdière matrix
• On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs
• An open research problem: strong completeness of R Kowalski's connection graph proof procedure

This page was built for publication: On the strong Arnol'd hypothesis and the connectivity of graphs

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