We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We compare three isolation concepts and the...

Many studies are aimed at identifying dense clusters/subgraphs from protein-protein interaction (PPI) networks for protein function prediction. However, the prediction performance based on the dense clusters is actually worse than a simple guilt-by-association method using neighbor counting ideas. This indicates that the local topological structures and properties of PPI networks are still open...

In a signed graph G, a negative clique is a complete subgraph having negative edges only. In this article, we give characteristic polynomial expressions, and eigenvalues of some signed graphs having negative cliques. This includes signed cycle graph, signed path graph, a complete graph with disjoint negative cliques, and star block graph with negative cliques.

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

This work examines the problem of clique enumeration on a graph by exploiting its covers. The principle inclusion/exclusion is applied to determine number cliques size $r$ in union set $\mathcal{C} = \{c_1, \ldots, c_m\}$ $m$ cliques. leads deeper examination sets involved and an orbit partition, $\Gamma$, power $\mathcal{P}(\mathcal{N}_{m})$ $\mathcal{N}_{m} \{1, m\}$. Applied cliques, this pa...

We introduce the notion of potential maximal cliquee of a graph and we use it for computing the treewidth and the minimum ll-in of graphs for which the the potential maximal cliques can be listed in polynomial time. Finally we show how to compute the potential maximal cliques of weakly triangulated graphs. triangulations RRsumm Nous introduisons la notion de clique potentielle maximalee d'un gr...

A clique clustering of a graph is a partitioning of its vertices into disjoint cliques. The quality of a clique clustering is measured by the total number of edges in its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge...

Résumé. Nous proposons une méthode de fouille de données sur des graphes ayant un ensemble d’étiquettes associé à chaque sommet. Une application est, par exemple, d’analyser un réseau social de chercheurs co-auteurs lorsque des étiquettes précisent les conférences dans lesquelles ils publient. Nous définissons l’extraction sous contraintes d’ensembles de cliques tel que chaque sommet des clique...