On the radius and diameter of the clique graph
type: Item
instance of: scholarly article
title: On the radius and diameter of the clique graph
zbMATH Open document ID: 0843.05030
DOI: 10.1016/0012-365X(94)00277-P
author: Ronald D. Dutton
author: Robert Brigham
published in: Discrete Mathematics
publication date: 1996-03-24T00:00:00Z
review text: 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.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 858066
zbMATH Keywords: clique graph
zbMATH Keywords: diameter
zbMATH Keywords: radius
MaRDI profile type: Publication
cites work: Parallel concepts in graph theory
cites work: On iterated clique graphs with increasing diameters
description: scientific article; zbMATH DE number 858066