A CHARACTERIZATION OF CLIQUE GRAPHS

Abstract

A graph-theoretic discussion following up a recent paper in which Hamelink obtains an interesting sufficient condition for a graph to be a clique graph. In the present study related conditions are given that are necessary as well as sufficient. As an application of the result, it is shown that Hamelink's condition is also necessary in certain special cases and that here it can be greatly simplified. As another application, certain theorems are derived that are useful in practice in reducing the question of whether certain smaller or simpler graphs are clique graphs. Next, the clique graph results are related to some work of Fulkerson and Gross on interval graphs and the consecutive 1's property. Finally, there are some remarks, motivated by the clique graph results, on graphs with no independent cut sets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1969
Accession Number
AD0684528

Entities

People

  • Fred S. Roberts
  • Joel H. Spencer

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Genetics
  • Intervals
  • Measurement
  • New York
  • Personality
  • Psychology
  • Triangles

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.