Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652489 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
In the study reported in this extended abstract we characterize the clique behavior of circulant graphs of the form Cn(a,b,c) with : 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 divergent, but no previously known technique could be used to prove it.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics