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

H. Holst, van der; L. Lovász; A. Schrijver

doi:10.1016/0024-3795(95)00160-S

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

H. Holst, van der
, L. Lovász
, A. Schrijver

Research output: Contribution to journal › Article › Academic › peer-review

14 Citations (Scopus)

Abstract

For any undirected graph G, let µ(G) be the graph invariant introduced by Colin de Verdière. In this paper we study the behavior of µ(G) under clique sums of graphs. In particular, we give a forbidden minor characterization of those clique sums G of G1 and G2 for which µ(G) = max{µ(G1), µ(G2)}.

Original language	English
Pages (from-to)	509-517
Journal	Linear Algebra and Its Applications
Volume	226-228
DOIs	https://doi.org/10.1016/0024-3795(95)00160-S
Publication status	Published - 1995

Access to Document

10.1016/0024-3795(95)00160-S

Cite this

@article{c0d86f1f26d54c4f97e0e4cb4a7f3561,

title = "On the invariance of Colin de Verdi{\`e}re's graph parameter under clique sums",

abstract = "For any undirected graph G, let µ(G) be the graph invariant introduced by Colin de Verdi{\`e}re. In this paper we study the behavior of µ(G) under clique sums of graphs. In particular, we give a forbidden minor characterization of those clique sums G of G1 and G2 for which µ(G) = max\{µ(G1), µ(G2)\}.",

author = "\{Holst, van der\}, H. and L. Lov{\'a}sz and A. Schrijver",

year = "1995",

doi = "10.1016/0024-3795(95)00160-S",

language = "English",

volume = "226-228",

pages = "509--517",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Holst, van der, H.

AU - Lovász, L.

AU - Schrijver, A.

PY - 1995

Y1 - 1995

N2 - For any undirected graph G, let µ(G) be the graph invariant introduced by Colin de Verdière. In this paper we study the behavior of µ(G) under clique sums of graphs. In particular, we give a forbidden minor characterization of those clique sums G of G1 and G2 for which µ(G) = max{µ(G1), µ(G2)}.

AB - For any undirected graph G, let µ(G) be the graph invariant introduced by Colin de Verdière. In this paper we study the behavior of µ(G) under clique sums of graphs. In particular, we give a forbidden minor characterization of those clique sums G of G1 and G2 for which µ(G) = max{µ(G1), µ(G2)}.

U2 - 10.1016/0024-3795(95)00160-S

DO - 10.1016/0024-3795(95)00160-S

M3 - Article

SN - 0024-3795

VL - 226-228

SP - 509

EP - 517

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

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

Abstract

Access to Document

Fingerprint

Cite this