• Corpus ID: 233481923

Triangle Centrality

@article{Burkhardt2021TriangleC,
  title={Triangle Centrality},
  author={Paul Burkhardt},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.00110}
}

• Paul Burkhardt
• Published 30 April 2021
• Mathematics
• ArXiv

Triangle centrality is introduced for finding important vertices in a graph based on the concentration of triangles surrounding each vertex. An important vertex in triangle centrality is at the center of many triangles, and therefore it may be in many triangles or none at all. Given a simple, undirected graph G = (V,E), with n = |V | vertices and m = |E| edges, where N(v) is the neighborhood set of v, N△(v) is the set of neighbors that are in triangles with v, and N + △(v) is the closed set that includes v, then the triangle centrality for v, where △(v) and △(G) denote the respective triangle counts of v and G, is given by