Network structure: k-cliques vs. p-cliques

Question

In network structure, what is the difference between k-cliques and p-cliques, can anyone give a brief explaination with examples? Thanks in advanced!

============================
EDIT: I found an online ppt while I am googling, please take a look on p.37 and p.39, can you comment on them?

In what context did you see these terms? It seems that `p` and `k` simply show the size of the subgraph, not a special category of them. — Amir Ali Akbari, Jun 19 '14 at 17:07

score 2 · Accepted Answer · answered Jun 19 '14 at 12:22

2

In graph theory a clique indicates a fully connected set of nodes: as noted here, a p-clique simply indicates a clique comoprised of p nodes. A k-clique is an undirected graph and a number k, and the output is a clique of size k if one exists.

Clique Problem

answered Jun 19 '14 at 12:22

MCP_infiltrator

996
11
10

please see the edit – user3663635 Jun 20 '14 at 02:29
an n-clique is something else altogether from a k-clique or a p-clique. The n-clique refers to a maximal distance between two subgroups, where a k-clique refers to a clique of size k, where k is some constant chosen, and a p-clique is simply a clique composed of p nodes again where p is a chosen constant – MCP_infiltrator Jun 20 '14 at 11:50

Network structure: k-cliques vs. p-cliques

1 Answers1