Journal ArticleDOI
On cliques in graphs
J. W. Moon,L. Moser +1 more
Reads0
Chats0
TLDR
In this article, the maximum number of cliques possible in a graph with n nodes is determined and bounds are obtained for the number of different sizes of clique possible in such a graph.Abstract:
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.read more
Citations
More filters
DissertationDOI
Cycle spectra of graphs
TL;DR: In this paper, the cycle spectrum of a graph G is the set of lengths of cycles in G and a lower bound on the circumference of the square G of G, which immediately implies a bound for the size of G.
Journal ArticleDOI
Communication Complexity and Graph Families
TL;DR: In this paper, the authors studied the communication complexity of the (F1, F2)-separating family problem in the two-party model and showed that the complexity of this problem is sublinear if and only if there are finitely many graphs in the intersection of these two families.
Proceedings ArticleDOI
Visual Cryptography Schemes for Graph Based Access Structures
TL;DR: Graph based access structures, where participants are nodes of a graph G and only subsets containing an edge are allowed to reconstruct the secret image are considered, are considered.
References
More filters