๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Mortality of iterated Gallai graphs

โœ Scribed by Van Bang Le


Book ID
105333737
Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
928 KB
Volume
27
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Iterated colorings of graphs
โœ Sandra M Hedetniemi; Stephen T Hedetniemi; Alice A McRae; Dee Parks; Jan Arne Te ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB
Diameters of iterated clique graphs of c
โœ Bor-Liang Chen; Ko-Wei Lih ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 272 KB

## Abstract The clique graph __K__(__G__) of a graph is the intersection graph of maximal cliques of __G.__ The iterated clique graph __K__^__n__^(__G__) is inductively defined as __K__(K^nโˆ’1^(__G__)) and __K__^1^(__G__) = __K__(__G__). Let the diameter diam(__G__) be the greatest distance between