Overlapping Community Detection Algorithm Based on High-Quality Subgraph Extension in Local Core Regions of Network

Table 1

The notations used in this paper.

Notations	Meaning
	An undirected and unweighted graph
	is a nonempty finite set of nodes
	is a nonempty finite set of edges
	The degree of node
	if there is an edge connection between nodes and . Otherwise,
	A subgraph formed by a node and its neighbor nodes
	The set of neighbor nodes of node
	The common neighbor edge of
	The cluster triangle in which edge participates
	The number of nodes in community
	The boundary nodes of community
	The number of boundary nodes of community