相关论文: Cliques in Paley graphs of square order and in Pei…
We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements…
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric…
Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise…
Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of $J_n(m, m-1)$ Johnson graphs. Cliques and maximal cliques are characterized and…
There are many methods to find a maximum (or maximal) clique in large networks. Due to the nature of combinatorics, computation becomes exponentially expensive as the number of vertices in a graph increases. Thus, there is a need for…
The problem of maximising the number of cliques among $n$-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of $1$-planar graphs where we determine precisely the maximum…
We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\'an's famous theorem. We consider the implications of the connectivity property of…
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…
In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…
Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum…
We consider the induced subgraph of the corresponding Grassmann graph formed by $q$-ary simplex codes of dimension $2$, $q\ge 5$. This graph contains precisely two types of maximal cliques. If $q=5$, then for any two maximal cliques of the…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
There is a conjecture that the second largest maximal cliques in Paley graphs of square order $P(q^2)$ have size $\frac{q+\epsilon}{2}$, where $q \equiv \epsilon \pmod 4$, and split into two orbits under the full group of automorphisms…
The induced subgraph of the corresponding Grassmann graph formed by simplex codes is considered. We show that this graph, as the Grassmann graph, contains two types of maximal cliques. For any two cliques of the first type there is a…
Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature \cite{Schaeffer}. It has various applications in pattern recognition, social networking and data mining…
In this paper we calculate the average number of cliques in random scale-free networks. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected…
The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…
We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the property that pairs of vertices with common neighbors tend to be…
We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.