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 ...

Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

Utilizing the edge-connectivity of graphs, certain maximally connected subgraphs of a graph termed k-components and clusters are characterized and their interrelations are investigated. The ...