Simplex graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A graph G and the corresponding simplex graph κ(G). The blue-colored node in κ(G) corresponds to the zero-vertex clique in G (the empty set), and the magenta node corresponds to the 3-vertex clique.

In graph theory, a branch of mathematics, the simplex graph κ(G) of an undirected graph G is itself a graph, with one node for each clique (a set of mutually adjacent vertices) in G. Two nodes of κ(G) are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex.

The empty set is included as one of the cliques of G that are used to form the clique graph, as is every set of one vertex and every set of two adjacent vertices. Therefore, the simplex graph contains within it a subdivision of G itself. The simplex graph of a complete graph is a hypercube graph, and the simplex graph of a cycle graph of length four or more is a gear graph. The simplex graph of the complement graph of a path graph is a Fibonacci cube.

The complete subgraphs of G can be given the structure of a median algebra: the median of three cliques A, B, and C is formed by the vertices that belong to a majority of the three cliques.[1] Any two vertices belonging to this median set must both belong to at least one of A, B, or C, and therefore must be linked by an edge, so the median of three cliques is itself a clique. The simplex graph is the median graph corresponding to this median algebra structure. When G is the complement graph of a bipartite graph, the cliques of G can be given a stronger structure as a distributive lattice,[2] and in this case the simplex graph is the graph of the lattice. As is true for median graphs more generally, every simplex graph is itself bipartite.

The simplex graph has one vertex for every simplex in the clique complex X(G) of G, and two vertices are linked by an edge when one of the two corresponding simplexes is a facet of the other. Thus, the objects (vertices in the simplex graph, simplexes in X(G)) and relations between objects (edges in the simplex graph, inclusion relations between simplexes in X(G)) are in one-to-one correspondence between X(G) and κ(G).

Simplex graphs were introduced by Bandelt & van de Vel (1989),[3] who observed that a simplex graph has no cubes if and only if the underlying graph is triangle-free, and showed that the chromatic number of the underlying graph equals the minimum number n such that the simplex graph can be isometrically embedded into a Cartesian product of n trees. As a consequence of the existence of triangle-free graphs with high chromatic number, they showed that there exist two-dimensional topological median algebras that cannot be embedded into products of finitely many real trees. Imrich, Klavžar & Mulder (1999) also use simplex graphs as part of their proof that testing whether a graph is triangle-free or whether it is a median graph may be performed equally quickly.

Notes[edit]

  1. ^ Barthélemy, Leclerc & Monjardet (1986), page 200.
  2. ^ Propp (1997).
  3. ^ Imrich, Klavžar & Mulder (1999) credit the introduction of simplex graphs to a later paper, also by Bandelt and van de Vel, but this appears to be a mistake.

References[edit]