On bipartite distance-regular graphs with exactly one non-thin T-module with endpoint two.

Mark S. MacLean Stefko Miklavic

Published in: Eur. J. Comb. (2017)

Keyphrases

real valued
bipartite graph
graph matching
distance transform
vertex set
graph partitioning
undirected graph
graph mining
weighted graph
distance measure
search engine
learning algorithm
directed graph
dissimilarity measure
distance function
graph model
high dimensional
graph representation
minimum distance