Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Victor Neumann"'
Autor:
Victor Neumann-Lara, F. Larrión
Publikováno v:
Graphs and Combinatorics. 13:263-266
We present an infinite set A of finite graphs such that for any graph G e A the order | V(k n (G))| of the n-th iterated clique graph k n (G) is a linear function of n. We also give examples of graphs G such that | V(k n(G))| is a polynomial of any g
Publikováno v:
Discrete Mathematics. (1-3):193-208
The clique graph K(G) of G is the intersection graph of all its (maximal) cliques. A connected graph G is self-clique whenever [email protected]?K(G). Self-clique graphs have been studied in several papers. Here we propose a hierarchy of self-clique