On the metric dimension and diameter of circulant graphs with three jumps.
Muhammad ImranAbdul Qudair BaigSaima RashidAndrea Semanicová-FenovcíkováPublished in: Discret. Math. Algorithms Appl. (2018)
Keyphrases
- iterative methods
- maximum common subgraph
- graph matching
- markov chain
- average degree
- pattern recognition
- subgraph isomorphism
- graph representation
- graph theoretic
- directed graph
- graph structure
- neural network
- complex structures
- similarity metric
- maximum distance
- series parallel
- graph mining
- temporal dimension
- graph databases
- graph theory
- metric space
- distance function
- nearest neighbor
- data structure
- feature extraction