An inequality involving two eigenvalues of a bipartite distance-regular graph.
Mark S. MacLeanPublished in: Discret. Math. (2000)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- edge weights
- graph representation
- graph theory
- undirected graph
- random walk
- directed graph
- covariance matrix
- adjacency matrix
- distance measure
- structured data
- euclidean distance
- eigenvalues and eigenvectors
- graph theoretic
- graph matching
- weighted graph
- graph structure
- link prediction
- covariance matrices
- distance function
- objective function
- graph construction
- image segmentation
- laplacian matrix
- search engine