Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Discrete Applied Mathematics. 161:1427-1439
The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques. We explore the effect of operations like edge contraction, edge removal and others on the dynamical behavior of a graph under the iteration of the clique opera