2022
DOI: 10.26493/1855-3974.2568.55c
|View full text |Cite
|
Sign up to set email alerts
|

On metric dimensions of hypercubes

Abstract: In this note we show two unexpected results concerning the metric, the edge metric and the mixed metric dimensions of hypercube graphs. First, we show that the metric and the edge metric dimensions of Q d differ by at most one for every integer d. In particular, if d is odd, then the metric and the edge metric dimensions of Q d are equal. Second, we prove that the metric and the mixed metric dimensions of the hypercube Q d are equal for every d ≥ 3. We conclude the paper by conjecturing that all these three ty… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…In this section, we prove that the edge metric dimension of the Cartesian product of a cycle and a path (cylinder graph) is a constant, regardless of the order of the cycle and the path. We will use the following theorems on the metric dimension of some Cartesian products [1] and an interesting relationship between metric dimension and edge metric dimension of a connected bipartite graph [8]. We compute the edge metric representation of each edge of…”
Section: The Edge Metric Dimension Of Cylinder Graphs C M 2p Nmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we prove that the edge metric dimension of the Cartesian product of a cycle and a path (cylinder graph) is a constant, regardless of the order of the cycle and the path. We will use the following theorems on the metric dimension of some Cartesian products [1] and an interesting relationship between metric dimension and edge metric dimension of a connected bipartite graph [8]. We compute the edge metric representation of each edge of…”
Section: The Edge Metric Dimension Of Cylinder Graphs C M 2p Nmentioning
confidence: 99%
“…[8] Let G be a connected bipartite graph. Then, every metric generator for G is also an edge metric generator, i.e., edim(G) ≤ dim(G).…”
mentioning
confidence: 99%