Triangle k Core

From visone manual
Revision as of 14:34, 8 June 2015 by Ortmann (talk | contribs)
Jump to navigation Jump to search

Triangle k Core

Definition Triangle Core

The triangle k-core of a simple undirected graph is the inclusion maximal subgraph where each edge is part of at least triangles in .

More detailed background information is provided in

Definition Triangle Core Number

The triangle core number of an edge is the maximal k such that