scientific article; zbMATH DE number 1303522

zbMATH Open0930.05065MaRDI QIDQ4250144FDOQ4250144

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

Publication date: 9 February 2000

Title of this publication is not available (Why is that?)

Recommendations

• The Colin de Verdière parameter, excluded minors, and the spectral radius
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The Colin de Verdière number and sphere representations of a graph
• The extremal function and Colin de Verdière graph parameter

zbMATH Keywords

eigenvalueplanaritysubdivisionstrong Arnold propertyclique sums\(\Delta Y\) transformationminor-monotonevector labellings

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (54)

• A linear bound for the Colin de Verdière parameter \(\mu\) for graphs embedded on surfaces
• Graph coloring and semidefinite rank
• On the Colin de Verdière graph number and penny graphs
• Improved bounds on the cop number when forbidding a minor
• Discrete quantitative nodal theorem
• The extremal function and Colin de Verdière graph parameter
• The inverse eigenvalue problem of a graph: multiplicities and minors
• On vertex partitions and some minor-monotone graph parameters
• Computing inertia sets using atoms
• On the graph complement conjecture for minimum rank
• Steinitz representations of polyhedra and the Colin de Verdière number
• Optimizing Colin de Verdière matrices of \(K_{4,4}\)
• A reduction procedure for the Colin de Verdière number of a graph
• Computing the zero forcing number for generalized Petersen graphs
• Embedding and the rotational dimension of a graph containing a clique
• Gershgorin disks for multiple eigenvalues of non-negative matrices
• Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
• Graphs with magnetic Schrödinger operators of low corank
• An infinite family of linklessly embeddable Tutte-4-connected graphs
• Tree densities in sparse graph classes
• The strong Arnold property for 4-connected flat graphs
• Multiplicity of  the second‐largest eigenvalue of a planar graph
• Sign patterns of orthogonal matrices and the strong inner product property
• Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
• Approximating the minimum rank of a graph via alternating projection
• On the number of edges in maximally linkless graphs
• Nullspace embeddings for outerplanar graphs
• Techniques for determining the minimum rank of a small graph
• Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
• Eigenpolytope Universality and Graphical Designs
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Graph coloring and semidefinite rank
• The Colin de Verdière number and graphs of polytopes
• Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
• Orthogonal realizations of random sign patterns and other applications of the SIPP
• Capturing polytopal symmetries by coloring the edge-graph
• On Vertex Partitions and the Colin de Verdière Parameter
• On the Colin de Verdière numbers of Cartesian graph products
• The Colin de Verdière number and joins of graphs
• Phase transition of degeneracy in minor-closed families
• Colin de Verdière parameters of chordal graphs
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• Graphs and obstructions in four dimensions.
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
• New bounds on maximal linkless graphs
• Global rigidity of triangulations with braces
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
• Expected values of parameters associated with the minimum rank of a graph
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• On the Colin de Verdière number of graphs
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property

This page was built for publication:

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