finds a largest k-club in the graph g.
Background & Context
- FindKClub finds one or more largest k-clubs in a graph, returning them as a list of vertices. Here, a k-club is a maximal set of vertices for which the diameter (i.e. the length of the longest possible path between two vertices) of the subgraph induced by the vertices is at most k. k-clubs are used in project selection, pattern matching, finance, and network analysis.
- In contrast, FindKClique can be used to find k-cliques of different subgraph diameter, from 1 to the largest possible size (in general n for a graph on n vertices).
- 1-clubs are cliques. While all k-clans are k-clubs, the converse is not always true. However, a k-club is always contained in a k-clique. Related functions include FindClique, FindKClan, FindKClique, and FindKPlex.
Examplesopen allclose all
FindKClub works with undirected graphs:
Properties & Relations (6)
Wolfram Research (2012), FindKClub, Wolfram Language function, https://reference.wolfram.com/language/ref/FindKClub.html (updated 2014).
Wolfram Language. 2012. "FindKClub." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2014. https://reference.wolfram.com/language/ref/FindKClub.html.
Wolfram Language. (2012). FindKClub. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindKClub.html