Article contents
A result on iterated clique graphs
Published online by Cambridge University Press: 09 April 2009
Abstract
S. T. Hedetniemi and P. J. Slater have shown that if G is a triangle-free connected graph with at least three vertices, then
where K(G) is the clique graph of G and K2(G) = K(K(G)) is the first iterated clique graph. In this paper, we generalize the above result to a wider class of graphs.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 4
- Cited by