indegC2

IndegC2 refers to the in-degree of the vertex labeled C2 in a directed graph. The in-degree of a vertex is the number of edges that terminate at that vertex, i.e., the number of immediate predecessors of C2. Formally, for a directed graph G=(V,E) and a vertex C2∈V, indeg(C2)=|{u∈V : (u,C2)∈E}|. In-degree is typically considered alongside out-degree, which counts edges leaving the vertex. In a simple directed graph, the total degree of a vertex can be expressed as deg(C2)=indeg(C2)+outdeg(C2). Conventions vary in the presence of loops or multiple edges; loops commonly contribute to both in-degree and out-degree, and multiple edges add to the corresponding counts.

Example: If three edges enter C2 from A, B, and D, then indeg(C2)=3. If C2 has two outgoing edges to E and F, then outdeg(C2)=2.

Computationally, indeg can be obtained from a graph’s representation. In an adjacency matrix A, where A[i][j] is the number of edges from vertex i to vertex j, indeg(j) is the sum over all i of A[i][j]. In an adjacency list, indeg(C2) is the count of edges with C2 as their target. In weighted or multi-graph contexts, indeg may be defined using the sum of edge counts or edge weights towards C2.

Applications of indegC2 include network analysis, centrality measures, citation and web graphs, and flow or dependency analyses. The term can also appear as a variable name in code or data sets storing the in-degree value for the node C2.