a polynomial algorithm for constructing the clique graph of a line graph：构造线图的团图的多项式算法.pdfVIP

Discrete Applied Mathematics 15 (1986) 61-66 61 North-Holland A POLYNOMIAL ALGORITHM FOR CONSTRUCTING THE CLIQUE GRAPH OF A LINE GRAPH Bruce H E D M A N Department of Mathematics, University of Connecticut, Trout Brook and Asylum A venues, West Hartford, CT 06117, USA Received 12 February 1985 Revised 27 January 1986 We will consider only finite, undirected, connected graphs without loops or multiple edges. A clique of graph G is a maximal complete subgraph of G. The clique graph K(G) of graph G is the intersection graph of the cliques of G. The line graph L(G) of graph G is the intersection graph of the edges of G. Thus, K(L(G)) is the clique graph of the line graph of G. This paper presents a five-step algorithm for constructing K(L(G)). As applications of the algorithm the results of two previous papers on K(L(G)) are subsumed as easy corollaries. Finally, additional corollaries are presented, including a description of K(L(Kn)). This algorithm is on the order O(n3), whereas constructing the clique graph of a general graph is NP-complete. 1. Terminology For terms not defined below we will follow Harary [1]. We will consider only finite, undirected, connected graphs without loops or multiple edges. Denote the vertex set of graph G by V(G), the number of vertices by ] V I, and the edge set by E(G). If Vl and 02 are vertices of G connected by an edge, then denote this edge by VlV2.A star is a set of edges containing a common vertex. A