On the invariance of Colin de Verdière's graph parameter under clique sums

DOI10.1016/0024-3795(95)00160-SMaRDI QIDQ1899429zbMATH OpenOpenAlexFDO

Authors Hein van der Holst, László Lovász, Alexander Schrijver

Publication date 31 March 1996

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

Full work available at URL https://doi.org/10.1016/0024-3795(95)00160-s

zbMATH Keywords

clique sumsgraph invariant

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

The graph invariant \(\mu(G)\) introduced by Colin de Verdière is studied under clique sums of graphs. A characterization of clique sums \(G\) of \(G_1\) and \(G_2\) with the property \(\mu(G)= \max\{\mu(G_1)\), \(\mu(G_2)\}\) is given.

Recommendations

• The Colin de Verdière number and joins of graphs
• On the Colin de Verdière number of graphs
• The extremal function and Colin de Verdière graph parameter
• On Vertex Partitions and the Colin de Verdière Parameter
• Colin de Verdière parameters of chordal graphs

Cites work

• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 475582 (Why is no real title available?)
• scientific article; zbMATH DE number 475583 (Why is no real title available?)
• Inertia characteristics of self-adjoint matrix polynomials
• Multiplicités des valeurs propres et transformations étoile-triangle des graphes
• On a minor-monotone graph invariant
• Sachs' linkless embedding conjecture
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)

Cited in

(12)

• Covering planar graphs with forests, one having bounded maximum degree
• On the null space of a Colin de Verdière matrix
• The extremal function and Colin de Verdière graph parameter
• Graphs with magnetic Schrödinger operators of low corank
• The Colin de Verdière number and joins of graphs
• A reduction procedure for the Colin de Verdière number of a graph
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
• On the Colin de Verdière number of graphs
• On the Colin de Verdière graph number and penny graphs
• Even maps, the Colin de Verdière number and representations of graphs

This page was built for publication: On the invariance of Colin de Verdière's graph parameter under clique sums

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