A new feasibility condition for distance-regular graphs.
Paul M. TerwilligerPublished in: Discret. Math. (1986)
Keyphrases
- sufficient conditions
- graph representation
- euclidean distance
- hamming distance
- graph structures
- graph mining
- graph theory
- distance function
- graph structure
- distance transform
- search algorithm
- graph partitioning
- social network analysis
- minimum distance
- neighborhood graph
- series parallel
- distance measurement
- structured objects