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 | |
Publication status | Published - 1995 |