The metric dimension of circulant graphs and their Cartesian products
Sign Up to like & getrecommendations! Published in 2017 at "Opuscula Mathematica"
DOI: 10.7494/opmath.2017.37.4.509
Abstract: Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct… read more here.
Keywords: circulant graphs; dimension; dimension circulant; leq leq ... See more keywords