The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one.
Yuanjiang ZhangXiaoye LiangJack H. KoolenPublished in: Discret. Math. (2022)
Keyphrases
- graph matching
- eigenvalues and eigenvectors
- graph theoretic
- distance measure
- distance function
- euclidean distance
- distance metric
- graph mining
- principal components
- hamming distance
- covariance matrix
- undirected graph
- graph partitioning
- principal component analysis
- distance matrix
- laplacian matrix
- clustering algorithm