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

Reversible iterative graph processes

โœ Scribed by Dourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L.

Book ID
119375334
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
321 KB
Volume
460
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Iterated colorings of graphs
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
Reversible competition processes
Reversible competition processes
โœ Donald L. Iglehart ๐Ÿ“‚ Article ๐Ÿ“… 1964 ๐Ÿ› Springer ๐ŸŒ English โš– 913 KB
Diameters of iterated clique graphs of c
Diameters of iterated clique graphs of chordal graphs
โœ 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