In the study reported in this extended abstract we characterize the clique behavior of circulant graphs of the form C n ( a , b , c ) with 0 < a < b < c < n ...
Determining the clique behavior of a graph means determining whether it is clique divergent or clique convergent. In general, this is not known to be computable ...
Such a circulant is clique divergent if and only if it is not clique-Helly. The main difficulty found here, was the case Cn(1, 2, 4) which is clique ...
The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques, and G is said to be clique divergent if the order of its n-th ...
The clique behavior of circulants with three small jumps. Published in Ars Combin., 2014. Recommended citation: F. Larrión, M. Pizaña, R. Villarroel-Flores, ...
[PDF] On the clique behavior of circulants with three small jumps ...
www.semanticscholar.org › paper
On the clique behavior of circulants with three small jumps · F. Larrión, M. Pizaña, R. Villarroel-Flores · Published in Electron. Notes Discret. Math… 1 December ...
The main difficulty found here, was the case Cn(1,2,4) which is clique divergent, but no previously known technique could be used to prove it.
Jan 1, 2014 · Resumen: The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques, and G is said to be clique divergent if ...
Villarroel-Flores, "The clique behavior of circulants with three small jumps." Ars Combin., 2014. Iterated clique graphs and bordered compact surfaces.
May 26, 2022 · The clique behavior of circulants with three small jumps. Ars Combin., 113A:147–160, 2014. [12] F. Larrión, M. A. Pizaña, and R. Villarroel ...