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
Journal ArticleDOI
The second largest number of maximal independent sets in connected graphs with at most one cycle
TL;DR: This paper determines the second largest number of maximal independent sets among all graphs (respectively, connected graphs) of order n≥4 with at most one cycle.
Journal ArticleDOI
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
TL;DR: On fait la conjecture que le nombre maximum de cliques d'un hypergraphe uniforme est atteint dans the classe deshypergraphes chromatiques complets.
Book ChapterDOI
A clustering approach using weighted similarity majority margins
TL;DR: A meta-heuristic algorithm for clustering objects that are described on multiple incommensurable attributes defined on different scale types is proposed and makes use of a bipolar-valued dual similarity-dissimilarity relation to perform the clustering process.
Book ChapterDOI
Faster Algorithms to Enumerate Hypergraph Transversals
TL;DR: In this paper, an exponential-time polynomial-space algorithm was proposed to enumerate all minimal transversals of hypergraphs of rank 3 in time O(1.6755 n).
References
More filters