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 journalArticleAcademicpeer-review

    12 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 languageEnglish
    Pages (from-to)509-517
    JournalLinear Algebra and Its Applications
    Volume226-228
    DOIs
    Publication statusPublished - 1995

    Fingerprint Dive into the research topics of 'On the invariance of Colin de Verdière's graph parameter under clique sums'. Together they form a unique fingerprint.

  • Cite this