Abstract: Clustering large hyperspectral images (HSIs) is a very challenging problem because large HSIs have high dimensionality, large spectral variability, and large computational and memory ...

Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...

Abstract: Clustering based on structured graph learning involves acquiring a proximity matrix with an explicit clustering structure from the original one. However, the original proximity matrix often ...

A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...

Binomial edge ideals constitute a vibrant research area where the methods of commutative algebra intersect with the combinatorial structures inherent in graph theory. By associating to each graph an ...

School of Mathematics and Statistics, Shandong Normal University, Jinan, China. In the next section, a statement of the problem is introduced. Afterwards, the proof of the main results is established.

For 0 ≤ α ≤ 1, Nikiforov proposed to study the spectral properties of the family of matrices Aα(G) = αD(G)+(1−α)A(G) of a graph G, where D(G) is the degree diagonal matrix and A(G) is the adjacency ...