 |
BUILT-IN MATHEMATICA SYMBOL
FindKPlex
FindKPlex[g, k]
finds a largest k-plex in the graph g.
FindKPlex[g, k, n]
finds a k-plex containing at most n vertices.
FindKPlex[g, k, {n}]
finds a k-plex containing exactly n vertices.
FindKPlex[g, k, {nmin, nmax}]
finds a k-plex containing between 
and 
vertices.
FindKPlex[g, k, nspec, s]
finds at most s k-plexes.
FindKPlex[{g, v}, k, ...]
finds k-plexes that include the vertex v only.
Details
- A k-plex is a maximal set of vertices such that each vertex is adjacent to all except k others.
- For a directed graph, the outgoing edges for each vertex connect to all except
others. - FindKPlex returns a list of k-plexes.
- FindKPlex will return an empty list if there is no k-plex.
- FindKPlex[..., k, nspec, All] finds all the k-plexes.
New in 9
