Premium
On iterated clique graphs with increasing diameters
Author(s) -
Peyrat C.,
Rall D. F.,
Slater P. J.
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100204
Subject(s) - iterated function , mathematics , combinatorics , block graph , split graph , clique , clique graph , graph , clique number , clique sum , chordal graph , discrete mathematics , clique problem , line graph , 1 planar graph , graph power , mathematical analysis
We examine the problem of finding a graph G whose n th iterated clique graph has diameter equal to the diameter of G plus n .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom