A new distance-regular graph of diameter 3 on 1024 vertices.
Minjia ShiDenis S. KrotovPatrick SoléPublished in: CoRR (2018)
Keyphrases
- average degree
- weighted graph
- edge weights
- maximum distance
- adjacency matrix
- labeled graphs
- vertex set
- undirected graph
- graph representation
- planar graphs
- minimum weight
- random walk
- directed edges
- maximum matching
- graph structure
- attributed graphs
- random graphs
- directed graph
- spanning tree
- graph model
- euclidean distance
- distance measure
- hamiltonian cycle
- neighborhood graph
- query graph
- distance matrix
- maximal cliques
- graph theory
- betweenness centrality
- graph clustering
- network size
- minimum spanning tree
- bipartite graph
- graph matching
- structured data
- distance function
- graph based algorithm
- graph databases
- phase transition
- data objects
- densely connected
- maximum cardinality
- np complete