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
An algorithm for the decomposition of finite languages
TL;DR: An algorithm for the decomposition of a finite language as a product (catenation) of two languages is presented and two additional algorithms are investigated: the first is based on the use of integer linear programming, and the second isbased on finding cliques in a graph.
Journal ArticleDOI
Minimal dominating sets in interval graphs and trees
TL;DR: It is shown that interval graphs on n vertices have at most 3 n / 3 ≈ 1.442 2 n minimal dominating sets, and that these can be enumerated in time O ∗ ( 3 n/3 ) , and that the same upper bound holds also for trees.
Book ChapterDOI
Predicting Neural Network Dynamics via Graphical Analysis
Katherine Morrison,Carina Curto +1 more
TL;DR: This chapter studies Combinatorial Threshold-Linear Networks in order to understand how the pattern of connectivity, as encoded by a directed graph, shapes the emergent nonlinear dynamics of the corresponding network.
Journal ArticleDOI
On Planar Toeplitz Graphs
Reinhardt Euler,Tudor Zamfirescu +1 more
TL;DR: Several classes of finite, planar Toeplitz graphs are described and results on their chromatic number are presented, then counting maximal independent sets in these graphs are turned to and recurrence equations and generating functions are determined.
Journal ArticleDOI
Sensitivity Analysis for Non-Interactive Differential Privacy: Bounds and Efficient Algorithms
TL;DR: This work proposes upper bounds on sensitivity that are tighter than those in previous work, and introduces methods that build a graph model based on a query set, such that implementing the aforementioned bounds can be achieved by solving two well-known clique problems.
References
More filters