On the partition dimension of a class of circulant graphs

DOI10.1016/j.ipl.2014.02.005zbMath1284.05081arXiv1507.05239OpenAlexW2012045373MaRDI QIDQ2446592

Sudeep Stephen, Mirka Miller, Cyriac Grigorious, Albert William, Bharathi Rajan

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05239

zbMATH Keywords

interconnection networkscirculant graphsmetric dimensionpartition dimension

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)

Related Items (9)

Partition dimension of rooted product graphs ⋮ On 2-partition dimension of rotationally-symmetric graphs ⋮ Further new results on strong resolving partitions for graphs ⋮ Partition dimension of certain classes of series parallel graphs ⋮ On the partition dimension of two-component graphs ⋮ Resolving dominating partitions in graphs ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ The partition dimension of circulant graphs ⋮ A method to construct graphs with certain partition dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the partition dimension of Cartesian product graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Conditional resolvability in graphs: a survey
• Resolvability in circulant graphs
• The partition dimension of a graph
• The partition dimension of Cayley digraphs
• Locating and total dominating sets in trees
• Discrepancies between metric dimension and partition dimension of a connected graph
• On the metric dimension of some families of graphs
• Reliable circulant networks with minimum transmission delay
• Structure-activity maps for visualizing the graph variables arising in drug design
• Resolving domination in graphs
• Optimal distance networks of low degree for parallel computers
• New binary coding results by circulants

This page was built for publication: On the partition dimension of a class of circulant graphs