On the radius and diameter of the clique graph (Q1910528)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the radius and diameter of the clique graph |
scientific article; zbMATH DE number 858066
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the radius and diameter of the clique graph |
scientific article; zbMATH DE number 858066 |
Statements
On the radius and diameter of the clique graph (English)
0 references
24 March 1996
0 references
The clique graph \(K\) of a graph \(G\) is the intersection graph of all maximal cliques of \(G\). It is shown that the diameter and the radius of \(K\) and \(G\) can differ by at most 1. A full characterization is given of graphs corresponding to each of these cases.
0 references
clique graph
0 references
diameter
0 references
radius
0 references
