The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}).
Cyriac GrigoriousThomas KalinowskiJoe RyanSudeep StephenPublished in: CoRR (2017)
Keyphrases
- graph theory
- random walk
- graph representation
- graph mining
- stable set
- connected components
- graph matching
- maximum common subgraph
- topological map
- graph theoretic
- bipartite graph
- fourier transform
- least squares
- distance measure
- euclidean distance
- distance metric
- graph model
- graph databases
- spanning tree
- directed graph
- evaluation metrics
- random graphs
- metric space
- graph construction
- graph structures
- neighborhood structure
- iterative methods
- neural network
- data sets