The metric dimension of the circulant graph C(n,±{1,2,3,4})

Title: The metric dimension of the circulant graph C(n,±{1,2,3,4})
Creator: Grigorious, Cyriac; Kalinowski, Thomas; Ryan, Joe; Stephen, Sudeep
Relation: Australasian Journal of Combinatorics Vol. 69, Issue 3, p. 417-441
Relation: https://ajc.maths.uq.edu.au/?page=get_volumes&volume=69
Publisher: Centre for Discrete Mathematics & Computing
Resource Type: journal article
Date: 2017
Description: Let G = (V,E) be a connected graph and let d(u, v) denote the distance between vertices u, v ∈ V . A metric basis for G is a set B ⊆ V of minimum cardinality such that no two vertices of G have the same distances to all points of B. The cardinality of a metric basis of G is called the metric dimension of G, denoted by dim(G). In this paper we determine the metric dimension of the circulant graphs C(n, ±{1, 2, 3, 4}) for all values of n.
Subject: metric dimension; circulant graphs; mathematics
Identifier: http://hdl.handle.net/1959.13/1395766
Identifier: uon:33940
Identifier: ISSN:1034-4942
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT02	Publisher version (open access)	215 KB	Adobe Acrobat PDF	View Details Download