No Detail Found!

On the partition dimension of circulant graph Cn(1, 2, 3, 4)

Author(s)
Asim Nadeem Department of Mathematics, UMT Lahore, Pakistan
Kamran Azhar Department of Mathematics, UMT Lahore, Pakistan
Sohail Zafar Department of Mathematics, UMT Lahore, Pakistan
Agha Kashif Department of Mathematics, UMT Lahore, Pakistan
Zohaib Zahid Department of Mathematics, UMT Lahore, Pakistan
Abstract
Let A = {B1, B2, . . . , Bl} be an ordered l-partition of a connected graph G(V (G), E(G)). The partition representation of vertex x with respect to ? is the l-vector, r(x|?) = ( d(x, B1), d(x, B2), . . . , d(x, Bl)), where d(x, B) = min{d(x, y)|y ? B} is the distance between x and B. If the l vectors r(x|?), for all x ? V (G) are distinct then l - partition is called a resolving partition. The least value of l for which there is a resolving l - partition is known as the partition dimension of G symbolized as pd(G). In this paper, the partition dimension of circulant graphs Cn(1, 2, 3, 4) is computed for n = 8 as,
Publication Details
Page(s) 117-133
DOI DOI not available
Published Journal: Punjab University Journal of Mathematics, Volume: 55, Issue: 3, Year: 2023

Request the full text from PASTIC

Keywords
Circulant graphs, partition dimension., Metric dimension
0

Citations

0

Downloads

78

Views