On Bipartite Q-Polynomial Distance-Regular Graphs with Diameter 9, 10, or 11.
Stefko MiklavicPublished in: Electron. J. Comb. (2018)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- maximum distance
- vertex set
- edge weights
- undirected graph
- distance function
- graph matching
- distance measure
- hamming distance
- graph databases
- graph representation
- weighted graph
- graph theoretic
- real valued
- euclidean distance
- complex structures
- graph mining
- structured data
- flow velocity