On Bipartite Distance-Regular Graphs with Intersection Numbers c i = (q i - 1)/(q - 1).
Stefko MiklavicPublished in: Graphs Comb. (2013)
Keyphrases
- bipartite graph
- graph model
- graph partitioning
- distance measure
- undirected graph
- graph theoretic
- distance function
- edge weights
- series parallel
- graph representation
- graph matching
- graph mining
- random graphs
- graph clustering
- labeled graphs
- real numbers
- subgraph isomorphism
- information retrieval
- spanning tree
- graph theory
- distance transform
- directed graph
- euclidean distance
- dimensionality reduction
- high dimensional