Some Results Relating Line Graphs, Clique Graphs and Graphs with No Triangles.

Abstract

A characterization of line graphs G of graphs with no triangles is given in terms of the clique structure of G. This in turn leads to a rather surprising result about iterated clique graphs of graphs with no triangles. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1971
Accession Number
AD0729271

Entities

People

  • Peter J. Slater
  • Stephen T. Hedetniemi

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Automata
  • Geometry
  • Machines
  • Triangles

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.