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
Book ChapterDOI
Finding uniform strategies for multi-agent systems
TL;DR: The algorithm finds all maximal uniform strategies for agents with incomplete information for enforcing a property expressible in the language of Alternating-time Temporal Logic ATL for automated program synthesis for systems that can be modeled as multi-agent systems with incomplete Information.
Journal ArticleDOI
Fixation probabilities in graph-structured populations under weak selection.
Benjamin L. Allen,Christine Sample,Patricia Steinhagen,Julia Shapiro,Matthew King,Timothy Hedspeth,Megan Goncalves +6 more
TL;DR: In this article, the authors explore the range of possible effects of graph structure on natural selection, genetic drift, and the balance between the two using exhaustive analysis of small graphs and a genetic search algorithm, identifying families of graphs with striking effects on fixation probability.
Journal Article
Core stability of minimum coloring games
TL;DR: It is shown that the minimum coloring game on a perfect graph has a stable core if and only if every vertex of the graph belongs to a maximum clique.
Journal ArticleDOI
On rejected arguments and implicit conflicts: The hidden power of argumentation semantics
Ringo Baumann,Wolfgang Dvořák,Thomas Linsbichler,Christof Spanring,Christof Spanring,Hannes Strass,Stefan Woltran +6 more
TL;DR: The main results show that under stable, preferred, semi-stable, and stage semantics neither of the classes is able to capture the full expressive power of these semantics, and refute a recent conjecture by Baumann et al. on implicit conflicts.
Book ChapterDOI
An exact algorithm for the minimum dominating clique problem
Dieter Kratsch,Mathieu Liedloff +1 more
TL;DR: An 0(1.3390) time algorithm is presented that for an input graph on n vertices either computes a minimum dominating clique or reports that the graph has no dominating cliques.
References
More filters