Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist.
Alexander L. GavrilyukAlexander A. MakhnevPublished in: Des. Codes Cryptogr. (2012)
Keyphrases
- euclidean distance
- graph representation
- graph matching
- distance measure
- genetic algorithm
- neighborhood graph
- random graphs
- graph theory
- directed graph
- structured objects
- real time
- distance function
- shortest path
- data mining
- bipartite graph
- distance transform
- np complete
- edge weights
- pattern recognition
- feature selection
- series parallel
- average distance