Connected component labeling (CCL) is a fundamental operation within image processing and computer vision, serving as the backbone for tasks such as object recognition, segmentation, and analysis. At ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

A connected component of an undirected graph is a set of nodes such that for any pair of nodes u and v in the set, there is a path from u to v. In the Normalized Laplacian Spectrum, the multiplicity ...

AbstractFor a non-trivial connected graph 𝐺, a set 𝑆 ⊆ 𝑉 (𝐺) is called an edge geodetic set of 𝐺 if every edge of 𝐺 is contained in a geodesic joining some pair of vertices in 𝑆. The edge ...