On the maximum value of the eccentric distance sums of cubic transitive graphs.
Yan-Ting XieShou-Jun XuPublished in: Appl. Math. Comput. (2019)
Keyphrases
- distance measure
- graph theory
- distance function
- euclidean distance
- distance metric
- graph matching
- graph clustering
- random variables
- data sets
- graph mining
- transitive closure
- graph representation
- graph structure
- city block
- distance matrix
- graph theoretic
- complex structures
- hamming distance
- spanning tree
- graph model
- bipartite graph
- directed graph
- pattern recognition