The Johnson graph J(d, r) is unique if (d, r) != (2, 8).
Paul M. TerwilligerPublished in: Discret. Math. (1986)
Keyphrases
- graph theory
- random walk
- graph representation
- directed graph
- graph structure
- graph matching
- adjacency matrix
- weighted graph
- bipartite graph
- structured data
- graph model
- case study
- equivalence classes
- connected components
- np hard
- relational databases
- graph databases
- graph partitioning
- graphical representation
- minimum spanning tree
- clustering algorithm