The Q-polynomial idempotents of a distance-regular graph.
Aleksandar JurisicPaul M. TerwilligerArjana ZitnikPublished in: J. Comb. Theory, Ser. B (2010)
Keyphrases
- random walk
- structured data
- graph representation
- distance measure
- graph theory
- distance function
- graph theoretic
- directed graph
- graph structure
- neural network
- directed acyclic graph
- weighted graph
- bipartite graph
- graph search
- connected components
- euclidean distance
- minimum distance
- graph based algorithm
- graph clustering
- minimum spanning tree
- path length
- edge weights
- distance transform
- graph matching
- np hard