An equitable partition for a distance-regular graph of negative type.
Stefko MiklavicPublished in: J. Comb. Theory, Ser. B (2005)
Keyphrases
- random walk
- positive and negative
- partitioning algorithm
- graph theory
- connected components
- directed graph
- learning algorithm
- distance matrix
- normalized cut
- graph theoretic
- graph partitioning
- distance transform
- distance measure
- stable set
- neural network
- graph representation
- undirected graph
- graph model
- graph structure
- structured data
- bipartite graph
- distance function
- distance metric
- edge weights
- markov random field
- path length
- high dimensional
- dependency graph
- vertex set
- graph matching