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 nmin and nmax 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.
FindKPlex[{vw,…},…]
uses rules vw to specify the graph g.
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.
- FindKPlex works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examples
open allclose allScope (13)
Specification (6)
FindKPlex works with undirected graphs:
Enumeration (7)
A 2-plex containing exactly 2 vertices:
A 2-plex containing at most 4 vertices:
A 2-plex containing between 3 and 5 vertices:
A largest 2-plex that includes a given vertex:
FindKPlex gives an empty list if there is no plex:
Applications (2)
Text
Wolfram Research (2012), FindKPlex, Wolfram Language function, https://reference.wolfram.com/language/ref/FindKPlex.html (updated 2015).
CMS
Wolfram Language. 2012. "FindKPlex." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/FindKPlex.html.
APA
Wolfram Language. (2012). FindKPlex. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindKPlex.html