On the partition dimension of a class of circulant graphs

•We study the Partition Dimension (PD) problem for a class of Circulant graphs.•Salman et al. proved that the PD is 4 for a class of Circulant graphs.•We improve this result. For a vertex v of a connected graph G(V,E) and a subset S of V, the distance between a vertex v and S is defined by d(v,S)=mi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 2014-07, Vol.114 (7), p.353-356
Hauptverfasser:	Grigorious, Cyriac, Stephen, Sudeep, Rajan, Bharati, Miller, Mirka, William, Albert
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Circulant graphs Data processing Geometry Graph representations Graph theory Graphs Interconnection networks Metric dimension Partition dimension Partitions Representations Series (mathematics) Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!