Login / Signup

Thin Distance-Regular Graphs with Classical Parameters $(D, q, q, \frac{q^{t}-1}{q-1}-1)$ with $t> D$ are the Grassmann Graphs.

Ying-Ying TanXiaoye LiangJack H. Koolen
Published in: Electron. J. Comb. (2021)
Keyphrases
  • graph matching
  • neural network
  • graph structure
  • graph clustering
  • graph kernels
  • lower bound
  • distance metric
  • probability density function
  • graph mining
  • graph databases
  • graph partitioning
  • graph embedding