Open Research Newcastle
Browse

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

Download (215.05 kB)
journal contribution
posted on 2025-05-09, 15:02 authored by Cyriac Grigorious, Thomas Kalinowski, Joseph RyanJoseph Ryan, Sudeep Stephen
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.

History

Journal title

Australasian Journal of Combinatorics

Volume

69

Issue

3

Pagination

417-441

Publisher

Centre for Discrete Mathematics & Computing

Language

  • en, English

College/Research Centre

Faculty of Science

School

School of Mathematical and Physical Sciences

Usage metrics

    Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC