An Explicit Infinite Family of 필-Vertex Graphs with Maximum Degree K and Diameter $\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}\mathbb{M}}$ for Each K - 1 a Prime Power.
Michael CapalboPublished in: Comb. (2021)
Keyphrases
- vertex set
- maximum distance
- average degree
- random graphs
- undirected graph
- directed graph
- special case
- attributed graphs
- labeled graphs
- hamiltonian cycle
- graph matching
- weighted graph
- power consumption
- phase transition
- connected subgraphs
- bipartite graph
- random walk
- minimum weight
- edge weights
- spanning tree
- minimum spanning tree
- graph data
- graph kernels
- subgraph isomorphism
- graph databases
- graph mining
- neural network