a partial characterization of clique graphs：团图的局部刻画.pdf

JOURNAL OF COMBINATORIALTHEORY5, 192-197 (1968) A Partial Characterization of Clique Graphs RONALD C. HAMELINK Department of Mathematics, Michigan State University East Lansing, Michigan 48823 Communicated by R. C. Bose ABSTRACT A partial characterization of clique graphs is given here, including a method for constructing a graph having a given graph as its clique graph, provided the given graph meets certain conditions. In addition, an example is presented to show the existence of graphs which are not clique graphs. l. DEHNITIONS AND NOTATIONS Graphs in this paper will be ordered pairs of sets, the first set, the vertex set, which is non-empty; and the second, the edge set, consisting of two element subsets of the vertex set. For a graph G, V(G) and E(G) will denote its vertex set and its edge set, respectively. A subgraph F of G is a graph where V(F) C V(G) and E(F) C E(G). A subgraph F of graph G will be called a section graph (or full subgraph) of G if E(F) = {{x,y}/x, y E V(F and {x, y) ~ E(G)}. A clique C of graph G is a section graph of G which is complete and is contained in no larger complete subgraph of G (i.e., C is a maximal complete subgraph of G). A clique graph of G is a graph F and a 1-1, onto mapping ~ from V(F) to the set of cliques of G which preserves incidence; that is x, y ~ V(F) are adjacent iff V(c~(x)) c~ V(~(y)) ~ r The definition of clique graph implies at once that i f F 1 and F2 are clique graphs of the same graph G then F1 is iso