Login / Signup
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme.
Aida Abiad
Robin Simoens
Sjanne Zeijlemaker
Published in:
Discret. Appl. Math. (2024)
Keyphrases
</>
data sets
polynomial time complexity
neural network
small number
graphical models
directed graph
weighted graph
multiple classes