On metric dimension of permutation graphs

Michael Hallaway (), Cong X. Kang () and Eunjeong Yi ()
Additional contact information
Michael Hallaway: Texas A&M University at Galveston
Cong X. Kang: Texas A&M University at Galveston
Eunjeong Yi: Texas A&M University at Galveston

Journal of Combinatorial Optimization, 2014, vol. 28, issue 4, No 8, 814-826

Abstract: Abstract The metric dimension $$\dim (G)$$ of a graph $$G$$ is the minimum number of vertices such that every vertex of $$G$$ is uniquely determined by its vector of distances to the set of chosen vertices. Let $$G_1$$ and $$G_2$$ be disjoint copies of a graph $$G$$ , and let $$\sigma : V(G_1) \rightarrow V(G_2)$$ be a permutation. Then, a permutation graph $$G_{\sigma }=(V, E)$$ has the vertex set $$V=V(G_1) \cup V(G_2)$$ and the edge set $$E=E(G_1) \cup E(G_2) \cup \{uv \mid v=\sigma (u)\}$$ . We show that $$2 \le \dim (G_{\sigma }) \le n-1$$ for any connected graph $$G$$ of order $$n$$ at least $$3$$ . We give examples showing that neither is there a function $$f$$ such that $$\dim (G) \dim (G_{\sigma })$$ for all pairs $$(G, \sigma )$$ . Further, we characterize permutation graphs $$G_{\sigma }$$ satisfying $$\dim (G_{\sigma })=n-1$$ when $$G$$ is a complete $$k$$ -partite graph, a cycle, or a path on $$n$$ vertices.

Keywords: Metric dimension; Permutation graph; Complete $$k$$ -partite graph; Cycle; Path; 05C12; 05D99; 05C38 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9587-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:4:d:10.1007_s10878-012-9587-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9587-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().