Three-connected graphs whose maximum nullity is at most three

DOI10.1016/J.LAA.2008.03.018zbMATH Open1145.05037OpenAlexW2166146423MaRDI QIDQ929488FDOQ929488

Authors: Hein van der Holst 

Publication date: 17 June 2008

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

Full work available at URL: https://doi.org/10.1016/j.laa.2008.03.018

Recommendations

• Extremal 3-connected graphs
• Maximum nullity and zero forcing number on graphs with maximum degree at most three
• Minimally 3-connected graphs
• The 3-connected graphs with exactly three non-essential edges
• A note on minimally 3-connected graphs
• On 3-connected graphs of path-width at most three
• Sufficient conditions for graphs to be maximally 3-restricted edge connected
• On \(3^*\)-connected graphs
• scientific article; zbMATH DE number 3987311
• On the connectedness of 3-line graphs

zbMATH Keywords

graph minorsymmetric matrixminimum rankstrong Arnold propertytree widthnullity 3partial tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph minors (05C83) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Title not available (Why is that?)
• On Linear Recognition of Tree-Width at Most Four
• Multiplicities of eigenvalues and tree-width of graphs
• Title not available (Why is that?)
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
• Graphs whose minimal rank is two
• Forbidden minors characterization of partial 3-trees
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Orthogonal representations and connectivity of graphs
• A characterization of tridiagonal matrices
• A correction: Orthogonal representations and connectivity of graphs

Cited In (18)

• The extremal function and Colin de Verdière graph parameter
• Lower bounds in minimum rank problems
• On the null space of a Colin de Verdière matrix
• Computing inertia sets using atoms
• On the graph complement conjecture for minimum rank
• Maximum generic nullity of a graph
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Maximum nullity of outerplanar graphs and the path cover number
• Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
• Title not available (Why is that?)
• On the Wiener index, distance cospectrality and transmission-regular graphs
• On minimum rank and zero forcing sets of a graph
• Zero forcing sets and the minimum rank of graphs
• Title not available (Why is that?)
• Graphs whose positive semi-definite matrices have nullity at most two
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• No graph has a maximal 3-ring of bonds
• Expected values of parameters associated with the minimum rank of a graph

This page was built for publication: Three-connected graphs whose maximum nullity is at most three

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