4
$\begingroup$

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?

$\endgroup$
2
  • 1
    $\begingroup$ 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. $\endgroup$ Commented Jun 19, 2014 at 17:07
  • $\begingroup$ please see the edit $\endgroup$ Commented Jun 20, 2014 at 2:27

1 Answer 1

2
$\begingroup$

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

$\endgroup$
2
  • $\begingroup$ please see the edit $\endgroup$ Commented Jun 20, 2014 at 2:29
  • $\begingroup$ 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 $\endgroup$ Commented Jun 20, 2014 at 11:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.