Eksakta: Berkala Ilmiah Bidang MIPA

VOLUME 22 NO 01 2021, pp xx-xx

ISSN : Print 1411-3724 — Online 2549-7464
Eksakta
Berkala Ilmiah Bidang MIPA
DOI : https://doi.org/10.24036//eksakta/vol21-iss1/xxx http://www.eksakta.ppj.unp.ac.id/index.php/
eksakta

Article
On the Metric Dimension for Snowflake Graph
Muhammad Rafif Fajri1*, Luthfi Hadiyan Fajri2, Jamaluddin
Ashari3, Abdurahman4 , Alifaziz Arsyad5
Article Info
Department of Mathematics and Data Science, Faculty of
1,2,5

Mathematics and Natural Science (FMIPA), Universitas Andalas,

Padang, Indonesia
Article history : 3
Department of Mathematics, Faculty of Mathematics and Natural
Received …., 2022 Science (FMIPA), Universitas Negeri Padang, Padang, Indonesia
4
Revised …., 2022 Department of Electrical Engineering, Faculty of Electrical
Accepted …., 2022 Engineering and Computer Science, Chien Hsin University of
Published …., 2022 Science and Technology（健行科技大學), Taoyuan, Taiwan.

Abstract. The concept of metric dimension is derived from

Keywords : resolving set of a graph, that is measure diameter among vertices
in a graph. For its usefulness in diverse fields, it is interesting to
matric dimension, find metric dimension of various class of graph. In this paper, we
graph, snowflake graph introduce two new graph, namely snowflake graph and
generalized snowflake graph. After we construct these graph,
aided with a lemma about lower bound of the metric dimension
on a graph that has leaves, and manually recognized the pattern,
we found that dim(Snow) = 24 and dim(Snow(n,a,b,c)) =
n(a+c+1).

This is an open acces article under the CC-BY license.

This is an open access article distributed under the Creative Commons 4.0 Attribution License, which
permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited. ©2021 by author.

Corresponding Author :
Author
Department of Mathematics and Data Science, Faculty of Mathematics and Natural Science (FMIPA),
Universitas Andalas, Padang, Indonesia
Email : rafiffajri00@gmail.com

1. Introduction
It is known that graph theory is an intense region of combinatorics that has large variety of
applications in diverse fields of science. Theoretical principles of graph theory are applied to practical

1
 Muhammad Rafif Fajri, et al. 2

fields, by determining graph invariants such as vertices, edges, diameter, and degree, then using them to
real-life problems. One concept that spread among all the graph theory is that of distance, and distance is
used in isomorphism testing, graph operations, maximal and minimal problems on connectivity and
diameter. Several parameters related to distances in graphs are highly attracting the attention of several
researchers. One of them, namely, the metric dimension, has specifically centered several investigations.
Slater in [1] and [2] initiated the concept of a resolving set for a connected graph G (and of a
minimum resolving set) under the term location set. He called the cardinality of a minimum resolving set
as the location number of G . Independently, Harary and Melter [3] introduced the same concept but used
the term metric dimension, rather than location number.
Gerey and Johnson in [4] showed that determining the metric dimension of graph is NP-complete
problem which is reduced from 3 dimensional marching (3DM), while Khuller et al [5] proved that it is
reduced from 3 satisfiability (3SAT). However, Chartrand et al. [6] have obtained some results as follows.

Theorem 1.1. [6] Let G be a connected graph of order n ≥ 2. Then

1. dim(G)=1 if only if G=P n.
2. dim(G)=n−1 if only if G=K n.
3. For n ≥ 3, dim(C n )=2
4. dim(G)=n−2 if only if G is either K r ,s for r , s ≥ 1, or K r + K s for r >1 , s ≥2 , or K r +( K 1 ∪ K s)
for r , s ≥ 1.

Some result for certain class of graphs have been obtained, such as cycles [7], trees ([3], [5], [6]),
fans [8], wheels [8]–[10], complete n -partite graphs [6], [11], unicyclic graphs [12], grids [13],
honeycomb networks [14]. circulant networks [15], cayley graphs [16], graphs with pendants [17],
jahangir graphs [18], amalgamation of cycles [19], regular bipartite graphs [20], corona product of Graphs
[21], lexicographic product of graphs [22], barycentric subdivision of cayley graphs [23], windmill
graphs [24], 2-connected graph [25], fullerene graphs [26], oriented graphs [27], generalized wheels [28],
binary products [29], cartesian powers of a graph [30], critical galton–watson trees [31].

The concept of metric dimension have been developed. There are several development obtained
such as edge metric dimensions [32] and local metric dimensions[33]. Some result for edge metric
dimension have been acquired, such as 2-connected graphs [34], one-heptagonal carbon nanocone [35],
hierarchical product [36], cacti [37], and unicyclic graph [38]. While, some result for local metric
dimension have been acquired, such as generalized hierarchical products [39] and graphs with small
clique numbers [40].

Other developments related to concept of metric dimensions are truncated metric dimensions
[41], metric dimensions vs. cyclomatic number of graphs [42], fractional edge dimension of graphs [43],
learning to compute metric dimensions [25], the dominant metric dimension [44], the complement metric
dimension [45], deletion on the edge metric dimension [46], extremal results of bounded metric
dimension [47], and robustness metric dimension [48].

A snowflake is a single ice crystal or collection of ice crystals that falls from the Earth's atmosphere.
Snowflakes come in various sizes and shapes. Snowflakes are white even though they are made of pure
ice. This is due to the diffuse reflection of the entire light spectrum on the small crystal. In Figure 1. An
example of a snowflake is given [49].

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 3

Figure 1. photo of snowflakes by Wilson Bentley (1865–1931)

In this paper, we define some new graph, that is a snowflake graph and a generalized snowflake
graph, which constructed by vertices and edges resembling one of the snowflake shapes. Then, we will
determine the metric dimensions of the snowflake graph and the general snowflake graph.

2. Notation
The vertices and edges set of a graph G are denoted by V (G) and E(G), respectively. We refer
the general graph theory notations and terminologies are not described in this paper to the book Graphs
and Digraphs [50].
Number of vertices that adjacent to a vertex v is called degree of vertex v. A vertex of degree one
is refered as a leaf. An edge incident with an end-vertex is called a pendant edge.
The distance d (u , v) between two vertices u and v in a connected graph G is the length of a
shortest u−v path in G . For an ordered set W ={w 1 , w 2 , ... , wk }⊆ V (G) of vertices, we refer to the
ordered k -tuple r (v∨W )=(d (v , w1) , d (v , w 2),... , d (v , w k )) as the (metric) representation of v with
respect to W . The set W is called a resolving set for G if r (u∨W )=r (v∨W ) implies that u=v , for all
u , v ∈G . A resolving set of minimum cardinality for a graph G is called a minimum resolving set or a
basis for G . The metric dimension dim(G) is the number of vertices in a basis for G .

3. Results
In this section, we define a snowflake graph and a generalized snowflake graph, and then determine the
metric dimensions of these graph. To determine such metric dimensions, we obtain a lemma related to the
lower bounds of the metric dimension on a graph that has leaves. This lemma arose from the need of
ensuring that every leaf that adjacent to the same vertex must have distinct representation.

Lemma 3.2. Let G be any connected graph which have n vertices that connected to pendant edges. If
n
vi ∈G connected with k i many vertices of degree one, then d ℑ(G)≥ ∑ ‍(k i−1), for all i∈[1 , n].
i=1

n
Proof. We will show that d ℑ(G)≥ ∑ ‍( k i−1), for all i∈[1 , n]. Let G is connected graph and vertex
i=1
vi ∈G connected with k i many vertices of degree one. Suppose the vertices of degree one connected with
vertex vi are v1 , j , where i∈[1 , n] and j ∈[1, k i ] . Without loss of generality, consider vertex v1 and v1 , j .
Suppose the set W =v (G)−{v 1 , v 1 , j } is a resolving set for G . Since d ( v 1 , v1 , k )=1 and edge v1 v 1 , k is
1 1

the only edge connecting v1 and v1 , k , then representation of v1 , j with respect to W is

i

r ( v 1,1∨W )=r (v 1,2 ∨W )=...=r ( v 1 ,k ∨W )=r (v i∨W )+(1). So, the representaton r ( v 1 ,i )≠ r (v 1, j ) for
1

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 4

i , j∈[1 , k 1 ], and then any k 1−1 edges of v1 , k must be a member of resolving set W . As a result, in
1
n
general, d ℑ(G)≥ ∑ ‍( k i−1).
i=1
Q.E.D
Here we formally introducing our new graph. A snowflake graph is a graph obtained by resembling one
of the snowflake shapes into vertices and edges, so that it forms a simple graph denoted snowflake graph.
The structure of the snowflake graph consists of tree graph and circle graph as shown in Figure 2. which
defined by the set of vertices and edges as follows.

Definiton 3.3.
V (Snow)={v 0 , v i , v i ,1 ,k , l , vi , 2 ,k , v i ,3,1 , l , v i ,k 5∨1 ≤i ≤ 6 ;1 ≤ k ≤2 ; 0 ≤ l≤ 2. } and
E( Snow)={v 0 v i ,3,1,0 , v i ,3,1,0 v i , 3,1, j , v i , 3,1,0 v i ,2,2 , v i ,2,2 vi , 2,1 , v i ,2,1 v i ,1,2,0 , v i ,1,2,0 v i ,1,2 , j , v i ,1,2,0 v i ,1,1,0 ,
vi , 1,1,0 v i ,1,1 , j , v i ,1,1,0 v a , v i ,2 , j v i , j , v i , j v i+1 (mod 6),2 , j∨1 ≤i ≤ 6 ; 1≤ j ≤2 }.

Theorem 3.4. If Snow is graph in Definition 3.3, then d ℑ(Snow)=24 .

Proof. Upper bound :

First, we will show that d ℑ ( Snow ) ≤24 . Suppose an ordered set
W ={v a , v 1,1,1,1 , v 1,1,2,1 , v 1,3,1,1 , v b , v 2,1,1,1 , v2,1,2,1 , v 2,3,1,1 , v c , v 3,1,1,1 , v 3,1,2,1 , v 3,3,1,1 , v d , v 4,1,1,1 ,
v 4,1,2,1 , v 4,3,1,1 , v e , v 5,1,1,1 , v 5,1,2,1 , v5,3,1,1 , v f , v 6,1,1,1 , v6,1,2,1 , v 6,3,1,1 },
where W ⊆ V ( Snow ) like figure 3.
Define the representation of V ( Snow) with respect to W as follow
r ( v∨W )=¿
d ( v , v 2,3,1,1 ) , d ( v , v 3) , d ( v , v 3,1,1,1 ) , d ( v , v 3,1,2,1 ) , d ( v , v 3,3,1,1 ) d ( v , v 4 ) ,d ( v , v 4,1,1,1 ) ,
d ( v , v 4,1,2,1 ) , d ( v , v 4,3,1,1 ) , d ( v , v 5 ) , d ( v , v 5,1,1,1 ) , d ( v , v 5,1,2,1 ) , d ( v , v5,3,1,1 ) , d ( v , v 6 ) ,
d ( v , v 6,1,1,1 ), d ( v , v 6,1,2,1 ), d (v , v 6,3,1,1 )¿.
for all v ∈V (snow).

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 5

Figure 2: Snow Graph

Figure 3: Partition of Snow Graph

Representation of each vertex in Snow given as follow.

r (v 1∨W )=(0,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8)
r (v 1,1,1,0 ∨W )=(1,1,2,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7 )
r ( v 1,1,1,1∨W )=(2,0,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8)
r ( v 1,1,1,2∨W )=(2,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8)
r ( v 1,1,2,0 ∨W )=(2,2,1,4,6,6,5,6,8,8,7,6,10,10,9,6,8,8,7,6,6,6,5,6 )
r (v 1,1,2,1∨W )=(3,3,0,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7)
r (v 1,1,2,2∨W )=(3,3,2,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7)
r (v 1,2,1∨W )=(3,3,2,3,5,5,4,5,7,7,6,5,9,9,8,5,7,7,6,5,5,5,4,5)
r (v 1,2,2∨W )=( 4,4,3,2,6,6,5,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,4)
r (v 1,1∨W )=(4,4,3,4,4,4,3,4,6,6,5,6,8,8,7,6,8,8,7,6,6,6,5,6 )
r (v 1,2∨W )=(5,5,4,4,5,5,4,3,7,7,6,5,9,9,8,5,9,9,8,5,7,7,6,5)
r (v 1,3,1,0 ∨W )=(5,5,4,1,7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3)
r (v 1,3,1,1∨W )=(6,6,5,0,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4 )
r (v 1,3,1,2∨W )=(6,6,5,2,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4 )
r (v 2∨W )=(8,8,7,8,0,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8)
r (v 2,1,1,0 ∨W )=(7,7,6,7,1,1,2,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7 )
r ( v 2,1,1,1 ∨W )=(8,8,7,8,2,0,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8)
r ( v 2,1,1,2 ∨W )=(8,8,7,8,2,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8)
r (v 2,1,2,0 ∨W )=(6,6,5,6,2,2,1,4,6,6,5,6,8,8,7,6,10,10,9,6,8,8,7,6)
r (v 2,1,2,1 ∨W )=(7,7,6,7,3,3,0,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7)
r (v 2,1,2,2 ∨W )=(7,7,6,7,3,3,2,5,7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7)
r (v 2,2,1∨W )=(5,5,4,5,3,3,2,3,5,5,4,5,7,7,6,5,9,9,8,5,7,7,6,5)

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 6

r (v 2,2,2∨W )=(6,6,5,4,4,4,3,2,6,6,5,4,8,8,7,4,8,8,7,4,8,8,7,4 )
r (v 2,1∨W )=(6,6,5,6,4,4,3,4,4,4,3,4,6,6,5,6,8,8,7,6,8,8,7,6)
r (v 2,2∨W )=(7,7,6,5,5,5,4,4,5,5,4,3,7,7,6,5,9,9,8,5,9,9,8,5)
r (v 2,3,1,0 ∨W )=(7,7,6,3,5,5,4,1,7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3)
r ( v 2,3,1,1 ∨W )=(8,8,7,4,6,6,5,0,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4 )
r ( v 2,3,1,2 ∨W )=(8,8,7,4,6,6,5,2,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4 )
r ( v 3∨W )=(10,10,9,8,8,8,7,8,0,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8)
r (v 3,1,1,0 ∨W )=(9,9,8,7,7,7,6,7,1,1,2,5,7,7,6,7,9,9,8,7,11,11,10,7)
r (v 3,1,1,1∨W )=(10,10,9,8,8,8,7,8,2,0,3,6,8,8,7,8,10,10,9,8,12,12,11,8)
r (v 3,1,1,2∨W )=(10,10,9,8,8,8,7,8,2,2,3,6,8,8,7,8,10,10,9,8,12,12,11,8)
r (v 3,1,2,0 ∨W )=(8,8,7,6,6,6,5,6,2,2,1,4,6,6,5,6,8,8,7,6,10,10,9,6)
r ( v 3,1,2,1∨W )=( 9,9,8,7,7,7,6,7,3,3,0,5,7,7,6,7,9,9,8,7,11,11,10,7)
r ( v 3,1,2,2∨W )=( 9,9,8,7,7,7,6,7,3,3,2,5,7,7,6,7,9,9,8,7,11,11,10,7)
r ( v 3,2,1∨W )=(7,7,6,5,5,5,4,5,3,3,2,3,5,5,4,5,7,7,6,5,9,9,8,5)
r (v 3,2,2∨W )=(8,8,7,4,6,6,5,4,4,4,3,2,6,6,5,4,8,8,7,4,8,8,7,4 )
r (v 3,1∨W )=(8,8,7,6,6,6,5,6,4,4,3,4,4,4,3,4,6,6,5,6,8,8,7,6)
r (v 3,2∨W )=(9,9,8,5,7,7,6,5,5,5,4,4,5,5,4,3,7,7,6,5,9,9,8,5)
r (v 3,3,1,0 ∨W )=(7,7,6,3,7,7,6,3,5,5,4,1,7,7,6,3,7,7,6,3,7,7,6,3)
r (v 3,3,1,1∨W )=(8,8,7,4,8,8,7,4,6,6,5,0,8,8,7,4,8,8,7,4,8,8,7,4 )
r (v 3,3,1,2∨W )=(8,8,7,4,8,8,7,4,6,6,5,2,8,8,7,4,8,8,7,4,8,8,7,4 )
r (v 4 ∨W )=(12,12,11,8,10,10,9,8,8,8,7,8,0,2,3,6,8,8,7,8,10,10,9,8)
r (v 4,1,1,0 ∨W )=(11,11,10,7,9,9,8,7,7,7,6,7,1,1,2,5,7,7,6,7,9,9,8,7)
r (v 4,1,1,1 ∨W )=(12,12,11,8,10,10,9,8,8,8,7,8,2,0,3,6,8,8,7,8,10,10,9,8)
r (v 4,1,1,2 ∨W )=(12,12,11,8,10,10,9,8,8,8,7,8,2,2,3,6,8,8,7,8,10,10,9,8)
r (v 4,1,2,0 ∨W )=(10,10,9,6,8,8,7,6,6,6,5,6,2,2,1,4,6,6,5,6,8,8,7,6)
r ( v 4,1,2,1 ∨W )=( 11,11,10,7,9,9,8,7,7,7,6,7,3,3,0,5,7,7,6,7,9,9,8,7)
r ( v 4,1,2,2 ∨W )=( 11,11,10,7,9,9,8,7,7,7,6,7,3,3,2,5,7,7,6,7,9,9,8,7)
r (v 4,2,1 ∨W )=( 9,9,8,5,7,7,6,5,5,5,4,5,3,3,2,3,5,5,4,5,7,7,6,5)
r ( v 4,2,2 ∨W )=(8,8,7,4,8,8,7,4,6,6,5,4,4,4,3,2,6,6,5,4,8,8,7,4)
r (v 4,1∨W )=(8,8,7,6,8,8,7,6,6,6,5,6,4,4,3,4,4,4,3,4,6,6,5,6 )
r (v 4,2∨W )=(9,9,8,5,9,9,8,5,7,7,6,5,5,5,4,4,5,5,4,3,7,7,6,5 )
r (v 4,3,1,0 ∨W )=(7,7,6,3,7,7,6,3,7,7,6,3,5,5,4,1,7,7,6,3,7,7,6,3)
r (v 4,3,1,1 ∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,0,8,8,7,4,8,8,7,4)
r (v 4,3,1,2 ∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,2,8,8,7,4,8,8,7,4)
r ( v 5∨W )=(10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,0,2,3,6,8,8,7,8)
r (v 5,1,1,0 ∨W )=(9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,1,1,2,5,7,7,6,7)
r (v 5,1,1,1∨W )=(10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,2,0,3,6,8,8,7,8)
r (v 5,1,1,2∨W )=(10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,2,2,3,6,8,8,7,8)
r (v 5,1,2,0 ∨W )=(8,8,7,6,10,10,9,6,8,8,7,6,6,6,5,6,2,2,1,4,6,6,5,6)
r ( v 5,1,2,1∨W )=( 9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,3,3,0,5,7,7,6,7)
r ( v 5,1,2,2∨W )=( 9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,3,3,2,5,7,7,6,7)

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 7

r ( v 5,2,1∨W )=(7,7,6,5,9,9,8,5,7,7,6,5,5,5,4,5,3,3,2,3,5,5,4,5)
r (v 5,2,2∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,4,4,4,3,2,6,6,5,4 )
r (v 5,1∨W )=(6,6,5,6,8,8,7,6,8,8,7,6,6,6,5,6,4,4,3,4,4,4,3,4)
r (v 5,2∨W )=(7,7,6,5,9,9,8,5,9,9,8,5,7,7,6,5,5,5,4,4,5,5,4,3)
r (v 5,3,1,0 ∨W )=(7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3,5,5,4,1,7,7,6,3)
r (v 5,3,1,1∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,0,8,8,7,4 )
r (v 5,3,1,2∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,2,8,8,7,4 )
r (v 6∨W )=(6,8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,0,2,3)
r (v 6,1,1,0 ∨W )=(7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,1,1,2,5)
r ( v 6,1,1,1 ∨W )=(8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,2,0,3,6 )
r ( v 6,1,1,2 ∨W )=(8,8,7,8,10,10,9,8,12,12,11,8,10,10,9,8,8,8,7,8,2,2,3,6 )
r (v 6,1,2,0 ∨W )=(6,6,5,6,8,8,7,6,10,10,9,6,8,8,7,6,6,6,5,6,2,2,1,4)
r (v 6,1,2,1 ∨W )=(7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,3,3,0,5)
r (v 6,1,2,2 ∨W )=(7,7,6,7,9,9,8,7,11,11,10,7,9,9,8,7,7,7,6,7,3,3,2,5)
r (v 6,2,1∨W )=(5,5,4,5,7,7,6,5,9,9,8,5,7,7,6,5,5,5,4,5,3,3,2,3)
r (v 6,2,2∨W )=(6,6,5,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,4,4,4,3,2)
r (v 6,1∨W )=(4,4,3,4,6,6,5,6,8,8,7,6,8,8,7,6,6,6,5,6,4,4,3,4 )
r (v 6,2∨W )=(5,5,4,3,7,7,6,5,9,9,8,5,9,9,8,5,7,7,6,5,5,5,4,4)
r (v 6,3,1,0 ∨W )=(7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3,7,7,6,3,5,5,4,1)
r (v 6,3,1,1 ∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,0 )
r (v 6,3,1,2 ∨W )=(8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,8,8,7,4,6,6,5,2)
Since r ( v a∨W )≠ r (v b ∨W ) implies that v a=v b, for all v a , v b ∈ V (Snow) , then W is resolving set for
Snow. Therefore, d ℑ(Snow)≤24 .

Lower bound :
Second, we will show d ℑ(Snow)≥24 . Choose the set edges of
that
A={vi , 1,1,0∨i ∈[1,6 ]∧v i ,1,1,0 ∈ E( Snow) } dan B={v j ,1,2,0 , v j ,3,1,0∨ j∈[ 1,6]o f ∧∈ E Snow ¿ }. The
sets A and B are, respectively, the set and dges connected by 3 and 2 edges of degree one, where
¿B∨¿‍(2−1)=6 (2)+ 12=24 ,¿

¿ A∨¿ ‍(3 −1 )+ ∑ ¿¿
¿ A∨¿ 6and ¿ B∨¿ 12. By Lemma 3.2,
i=1
so
d ℑ(Snow)≥ ∑ ¿
i=1
d ℑ(Snow)≥24 .
Putting the bounds together gives us, that d ℑ(Snow)=24.
Q.E.D

A generalized snowflake graph, denoted by Snow(n , a , b , c) , is a Snow graph with n parts of the stem,
a pair of outer leaves, b middle circle, and c pairs of inner leaves as shown in Figure 4 . The set of
vertices and edges of the graph defined as follows.

Definition 3.5.
V (Snow(n , a , b , c ))={v 0 , v i , v i ,1 , j , k , vi , 2 ,l , v i ,3 , p ,k , v i ,l∨1 ≤ i ≤ n ; 1≤ j ≤ a ; 0 ≤ k ≤ 2 ; 1≤ l≤ b ;1 ≤ p ≤ c }
and

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 8

E(Snow( n , a ,b ,c ))={v 0 v i ,3 ,c , 0 , vi , 3 , j ,0 v i ,3 , j+1,0 , vi , 3 ,k , 0 v i ,3 ,k , l , v i ,3,1,0 v i , 2, b , v i ,2 , p vi , 2 , p+ 1 , v i , 2,1 v i ,1 ,a , 0 ,

vi , 1 ,q , 0 v i ,1,1,0 , v i , v i ,2 , r v i ,r , v i , r v i+1 ( mod n) ,2 , r∨1 ≤i ≤ n; 1 ≤ j ≤ c−1; 1 ≤ k ≤ c ;
1 ≤l ≤2 ; 1 ≤ p ≤ b−1 ; 1 ≤q ≤a−1 ; 1≤ r ≤ b .}

Figure 4: Snow(n , a , b , c)

Theorem 3.6. If Snow(n , a , b , c) is graph in Definition 3.5, then d ℑ(Snow)=n(a+ c+1) for all
n , a , b , c ∈ N and n ≥ 3.

Proof. Upper Bound :

First, we will show that d ℑ(Snow(n , a , b , c))≤ n( a+c +1) . Suppose an ordered set
W ={v 1 , v 1,1,1,1 , v1,1,2,1 ,… , v 1,1 ,a ,1 , v 1,3,1,1 , v 1,3,2,1 ,… , v 2,3,c ,1 , v 2 , v 2,1,1,1 , v 2,1,2,1 , … , v 2,1, a ,1 , v 2,3,1,1 ,
v 2,3,2,1 ,... , v 2,3 , c ,1 ,... , ..., v n , v n, 1,1,1 , v n ,1,2,1 , ... , v n ,1 , a ,1 , v n ,3,1,1 , v n , 3,2,1 ,... , v n ,3 , c ,1 } ,

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 9

Where W ⊆V (Snow(n , a , b , c )) and ¿ W ∨¿ n(a+ c+1).

Figure 4: Partition of Snow(n , a , b , c) Graph

Define the representation of V (Snow(n , a , b , c )) with respect to W as follow

r ( v∨W )=¿
d ( v , v 2,3, c ,1 ) , d ( v , v 2 ) , d ( v , v 2,1,1,1 ) , d ( v , v 2,1,2,1 ) , … , d ( v , v 2,1 , a ,1 ) , d ( v , v 2,3,1,1 ) ,
d ( v , v 2,3,2,1 ) , … ,d ( v , v2,3 ,c ,1 ) , … , … , d ( v , v n ) , d ( v , v n ,1,1,1 ) , d ( v , v n ,1,2,1 ) , … ,
d ( v , v n , 1 ,a ,1 ) , d (v , v n ,3,1,1 ), d (v , v n ,3,2,1 ) ,... , d ( v , v n , 3 ,c ,1 )),
for all v ∈V ( Snow ( n , a , b , c ) ).

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 10

Let W 1= { v 1 , v 2 ,… , v n }, W 2={v 1 , v 1,1, j ,1 , v 2 , v 2,1 , j ,1 ,… , v n , v n ,1 , j ,1 }, and

W 3 ={ v 1 , v 1,3 , j ,1 , v 2 , v 2,3 , j ,1 … , v n , v n ,3 , j ,1 }, be an ordered sets, where W 1 ⊆ W 2 ⊆W and W 1 ⊆ W 3 ⊆W .
So, r ( v|W 1 )=( d ( v , v 1 ) , d ( v , v 2) , … , d ( v , v n ) ), W 2={v 1 , v 1,1, j ,1 , v 2 , v 2,1, j ,1 ,… , v n , v n ,1 , j ,1 }, and
W 3 ={v1 , v 1,3 , j ,1 , v 2 , v 2,3 , j ,1 ..., v n , v n ,3 , j ,1 } .
Representation of each vertex in Snow (n , a , b , c) given as follow.
1. Representation of v 0 with respect to W 1 ⊆W is
r ( v 0∨W 1)=(a+b +c +1 ,a+ b+c +1 , ..., a+ b+c +1).
2. Representation of vi , i∈[1 , n], with respect to W 1 ⊆ W are

( n
{(
r ( v1 , W 2 )= 0 , min { 2 a+ 4,2 ( a+ b+c +1 ) } , min { 2 a+6,2 ( a+b+ c+1 ) } , … , min 2 a+1+ ⌊ ⌋ , 2 ( a+b+ c+ 1 ) , … , min
2 ) }
) ( {( n
r ( v 2 , W 2 = min { 2 a+ 4,2 ( a+b+ c+1 ) } , 0 , min { 2 a+4,2 ( a+ b+c +1 ) } , min { 2a+ 6,2 ( a+b+c +1 ) } , … , min 2 a+1+ ⌊
2
⋮

( n
{(
r ( v n , W 2 ) = min {2 a+ 4,2 ( a+b+ c+1 ) } , min { 2 a+6,2 ( a+ b+c +1 ) } , … ,min 2 a+ 1+ ⌊ ⌋ ,2 ( a+ b+c +1 ) , … , min { 2 a
2 ) }
Since r ( v r , W 1)≠ r (v s , W 1 ) and W 1 ⊆ W , then r (v r , W )≠ r (v s ,W ), for all r , s ∈[1 , n].
3. Representation vi , 1 , j , 0, i∈[1 , n] and j ∈[1, a] with respect to W 1 ⊆ W are

( n
r ( v1,1 , j , 0 ,W 1 ) = j , min {2 a+ 4− j , 2 ( a+b+ c+1 ) − j } , min { 2 a+6− j , 2 ( a+ b+c +1 )− j } , … ,min 2 a+ 1+ ⌊ ⌋ − j, 2
2 {( )
) (
r ( v1,1 , j , 0 ,W 1 = min { 2 a+4− j, 2 ( a+b+ c+ 1 )− j } , j , min { 2 a+4− j ,2 ( a+b +c +1 )− j } , min { 2 a+6− j, 2 ( a+b+ c+1 )

( n
r ( v1,1 , j , 0 ,W 1 ) = min { 2 a+4− j, 2 ( a+b+ c+ 1 )− j } , min { 2 a+6− j , 2 ( a+b+ c+1 ) − j } , … , min 2 a+1+⌊ ⌋ − j ,2 ( a+
2 {( )
Since r ( v r , 1, j , 0 , W 1 )≠ r (v s , 1, j , 0 , W 1 ) and W 1 ⊆ W , then r ( v r , 1, j , 0 , W ) ≠r (v s , 1 , j , 0 ,W ), for all
r , s ∈[1 , n].
4. Representation vi , 1 , j , k , ∀ i∈[1, n] , j ∈[1, a] , and k ∈[1,2] with respect to W 2 ⊆ W as follow

(
r ( v1,1 , j , 1|W 2 )= j+1,0 , min { 2 a− j+5,2 ( a+b+ c ) −3− j } ,min {2 a−2 j+6,2 ( a+b+ c− j ) +2 } , min { 2 a− j+7,2 ( a+b+ c

(
r ( v 2,1, j , 1|W 2 )= min { 2 a− j+5,2 ( a+b+ c ) −3− j } , min {2 a−2 j+6,2 ( a+b+ c− j ) +2 } , j+1,0 , min { 2 a− j+5,2 ( a+b+ c

(
r ( v n ,1 , j ,1|W 2 )= min { 2 a− j+5,2 ( a+b+ c )−3− j } , min { 2 a−2 j+6,2 ( a+b +c− j )+2 } , min { 2 a− j+7,2 ( a+b+ c )−3−

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 11

(
r ( v1,1 , j , 2|W 2 )= j +1,2 , min { 2 a− j+ 5,2 ( a+ b+c )−3− j } , min { 2 a−2 j+ 6,2 ( a+b+ c− j ) +2 } , min { 2 a− j+ 7,2 ( a+ b+c

(
r ( v 2,1, j , 2|W 2 )= min { 2 a− j+5,2 ( a+b+ c )−3− j } , min {2 a−2 j+6,2 ( a+b+ c− j ) +2 } , j+1,2 , min { 2 a− j+ 5,2 ( a+ b+c

(
r ( v n ,1 , j ,2|W 2 )= min { 2 a− j+5,2 ( a+b+ c )−3− j } , min { 2 a−2 j+6,2 ( a+b +c− j )+ 2 } , min { 2 a− j+7,2 ( a+b+ c )−3−

Since r (v r , 1, j , k ,W 2 )≠ r (v s , 1, j , k ,W 2 ) and W 2 ⊆ W , then r (v r , 1, j , k ,W )≠r (v s , 1 , j , k ,W ), for all

r , s ∈[1 , n].
5. Representation vi , 3 , j ,0, ∀ i∈[1, n] for j ∈[1, c ] with respect to W 1 ⊆ W are

(
r ( v1,3 , j , 0 ,W 1) = a+b+ j , min { a+b+ j+ 2, a+ b+2 c− j+ 2 } , min { a+ b+ j+ 4 , a+b+ 2 c− j+2 } , … , min a+ b+ j+2 ⌊ { n
2

(
r ( v 2,3, j ,0 ,W 1) = min { a+b+ j+2 , a+b+2 c− j+2 } , a+b+ j, min { a+ b+ j+2 , a+b+ 2 c− j+2 } , min { a+b+ j+4 , a+b+2

( n
r ( v n ,3 , j ,0 ,W 1 )= min { a+b + j+2 , a+b+ 2c − j+2 } , min { a+b+ j+ 4 ,a+ b+2 c− j+ 2 } , … , min a+b+ j+2 ⌊ ⌋ , a+b+
2 {
Since r (v r , 3 , j , 0 ,W 1 )≠ r (v s , 3 , j , 0 ,W 1) and W 1 ⊆ W , then r ( v r , 3 , j , 0 ,W ) ≠r (v s ,3 , j ,0 ,W ) , for all
r , s ∈[1 , n].
6. Representation vi , 3 , j ,k , ∀ i ∈[1, n] , j ∈[1, c ], and k ∈[1,2] with respect to W 3 ⊆ W are

(
r ( v1,3 , j , 1|W 3 )= a+ b+ j+1,0 , min { a+ b+ j+3 , a+ b+2 c− j+3 } , min { 2 j+4,2 ( c− j+1 ) } ,min {a+ b+ j+5 , a+ b+2 c− j

r ( v 2,3 , j ,1∨W 3)=(min { a+ b+ j+3 , a+ b+2 c− j+3 } , min { 2 j+4,2 ( c− j+1 ) } , a+b+ j+ 1,0 ,min {a+ b+ j+3 ,a+ b+2 c−

⋮
r ( v n ,3 , j ,1 ∨W 3)=(min {a+ b+ j+3 ,a+ b+2 c− j+ 3 } ,min { 2 j+ 4,2 ( c − j+1 ) } , min { a+b+ j+5 , a+b+2 c− j+3 } , min { 2

(
r ( v1,3 , j , 2|W 3 )= a+ b+ j+1,2 , min { a+b+ j+3 , a+b+ 2 c− j+3 } , min { 2 j+4,2 ( c− j+ 1 ) } , min { a+ b+ j+5 , a+ b+2 c− j

r ( v(2,3 , j , 2) │ W 3)=(min ⁡{a+b + j +3 , a+b +2 c− j +3 },min ⁡{2 j+ 4,2(c − j+1)}, a+b+ j+ 1,2, min ⁡{a+b+ j +3 , a+b+
⋮

(
r ( v n ,3 , j ,2|W 3 ) = min { a+b+ j+ 3 , a+b+2 c− j+ 3 } ,min {2 j+ 4,2 ( c− j+1 ) } , min { a+b+ j+5 , a+b+2 c− j +3 } , min { 2 j+

Since r ( v r , 3 , j , k ,W 3)≠r (v s , 3 , j ,k ,W 3) and W 3 ⊆ W , then r ( v r , 3 , j , k ,W ) ≠ r (v s ,3 , j ,k , W ) , for all

r , s ∈[1 , n].
7. Representation vi , 2 , j , ∀ i ∈[1, n] and j ∈[1, b] with respect to W 1 ⊆ W are

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 12

( n
r ( v1,2 , j , W 1 )= j+ a , min { a+ j +2 , a+2 b+2 c +2− j } , min { a+ j+4 , a+2 b+2 c+ 2− j } , … , min a+ j+2 ⌊ ⌋ , a+ 2b+ 2
2 {
(
r ( v 2,2, j , W 1 )= min { a+ j+2 , a+2 b+2 c+ 2− j } , j+a ,min { a+ j+2 , a+2 b+2 c+ 2− j } , min { a+ j+ 4 ,a+ 2b +2 c+2− j }

( n
r ( v n ,2 , j , W 1 ) = min { a+ j+2 , a+2 b+2 c +2− j } , min { a+ j+4 , a+2 b+2 c+ 2− j } , … , min a+ j+2 ⌊ ⌋ , a+2 b+ 2c +2
2 {
Since r ( v r , 2, j , W 1) ≠ r (v s ,2 , j ,W 1) and W 1 ⊆ W , then r (v r , 2, j , W )≠ r (v s ,2 , j ,W ), for all r , s ∈[1 , n].
8. Representation vi , j , ∀ i∈[1, n] and j ∈[1, b] with respect to W 1 ⊆ W are
n
r ( v 1 , j , W 1 )=( a+ j+1 , min { a+ j+3 ,a+ 2b +2 c+3− j } , min { a+ j+ 5 , a+2 b+2 c+ 3− j } , … , min a+ j+1+2 ⌊ ⌋ , a+
2 {
r ( v 2 , j , W 1 )=( min { a+ j +3 , a+ 2b+ 2c +3− j } , a+ j+1 , min { a+ j+ 3 , a+2 b+2 c+ 3− j } , min { a+ j +5 , a+2 b+2 c+ 3−

⋮
n
r ( v n , j , W 1 )=(min { a+ j+3 , a+ 2b +2 c+3− j } , min { a+ j+ 5 ,a+ 2b +2 c+3− j } , … , min a+ j +1+2 ⌊ ⌋ , a+2 b+ 2c +
2 {
since r ( v r , j ,W 1) ≠r (v s , j , W 1) and W 1 ⊆ W , then r (v r , j ,W ) ≠ r (v s , j , W ), for all r , s ∈[1 , n].

Since W 1 ⊆W 2 ⊆W dan W 1 ⊆W 3 ⊆W , then the representaton of each vertex with respect to W 1 ,

W 2, and W 3 will correspond to representation with respect to W . Since r ( v a∨W ) ≠ r (v b ∨W ) implies
that v a=v b, for all v a , v b ∈ V (Snow (n , a , b , c)), then W is resolving set for Snow . Therefore,
d ℑ(Snow( n , a , b , c))≤ n( a+c +1).

Lower Bound :
Second, we will show that d ℑ(Snow( n , a , b , c))≥ n(a+c +1). Choose the set edges of
A={vi , 1,1,0 ∈V ¿ dan B={v i ,1 , j , 0 , v i , 3 ,k , 0 ∈V ¿ . The sets A and B are, respectively, the set of edges
connected by 3 and 2 edges of degree one, where ¿ A∨¿ nand ¿ B∨¿ n( a+c ). By Lemma 3.2,
¿ B∨¿ ‍( 2−1)=n(2 )+n( a−1 +c)=n(a +c+ 1) ,¿

¿ A ∨¿ ‍( 3−1)+ ∑ ¿¿
so d ℑ(Snow(n , a , b , c))≥ n(a+c +1).
i=1

d ℑ(Snow(n , a , b , c))≥ ∑ ¿
i=1

Putting the bounds together gives us that d ℑ(Snow(n , a , b , c))=n(a+c +1).

4. Conclusion and future works

In this paper, we have defined a snowflake graph in Definition 3.3 and generalized snowflake graph in
Definition 3.5. Supported with a lemma about lower bound of the metric dimension of such graph, we
find dim( Snow)=24 proved in Theorem 3.4 and dim( Snow(n , a , b , c))=n(a+c +1) proved in
Theorem 3.6.

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
 Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 13

However, it is interesting to find other measure of these graph such as edge metric dimension, total metric
dimension, partition dimension, and chromatic location number. In addition, it is worth to consider that
there are many other graph that could be formed based on various snowflakes shape other than the shape
we define in this paper.

References

[1] P. J. Slater, “Leaves of trees,” Congr. Numer, vol. 14, no. 549–559, p. 37, 1975.
[2] P. J. Slater, “Dominating and reference sets in a graph,” J. Math. Phys. Sci, vol. 22, no. 4, pp. 445–
455, 1988.
[3] F. H. Melter and F. Harary, “On the metric dimension of a graph,” Ars Combin, vol. 2, pp. 191–195,
1976.
[4] M. R. Garey, “A Guide to the Theory of NP-Completeness,” Computers and intractability, 1979.
[5] S. Khuller, B. Raghavachari, and A. Rosenfeld, “Landmarks in graphs,” Discrete Appl Math (1979),
vol. 70, no. 3, pp. 217–229, Oct. 1996, doi: 10.1016/0166-218X(95)00106-2.
[6] G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann, “Resolvability in graphs and the metric
dimension of a graph,” Discrete Appl Math (1979), vol. 105, no. 1–3, pp. 99–113, Oct. 2000, doi:
10.1016/S0166-218X(00)00198-0.
[7] G. Chartrand, C. Poisson, and P. Zhang, “Resolvability and the upper dimension of graphs,”
Computers & Mathematics with Applications, vol. 39, no. 12, pp. 19–28, Jun. 2000, doi:
10.1016/S0898-1221(00)00126-7.
[8] C. Hernando, M. Mora, I. M. Pelayo, C. Seara, J. Cáceres, and M. L. Puertas, “On the metric
dimension of some families of graphs,” Electron Notes Discrete Math, vol. 22, pp. 129–133, Oct.
2005, doi: 10.1016/j.endm.2005.06.023.
[9] P. S. Buczkowski, G. Chartrand, C. Poisson, and P. Zhang, “On k-dimensional graphs and their
bases,” Period Math Hung, vol. 46, no. 1, pp. 9–15, Oct. 2004, doi: 10.1023/A:1025745406160.
[10] B. Shanmukha, B. Sooryanarayana, and K. S. Harinath, “Metric dimension of wheels,” Far East J.
Appl. Math, vol. 8, no. 3, pp. 217–229, 2002.
[11] S. W. Saputro, E. T. Baskoro, A. N. M. Salman, and D. Suprijanto, “The metric dimensions of a
complete n-partite graph and its Cartesian product with a path,” Journal of Combinatorial
Mathematics and Combinatorial Computing, vol. 71, p. 283, 2009.
[12] C. Poisson and P. Zhang, “The metric dimension of unicyclic graphs,” Journal of combinatorial
mathematics and combinatorial computing, vol. 40, pp. 17–32, 2002.
[13] R. A. Melter and I. Tomescu, “Metric bases in digital geometry,” Comput Vis Graph Image Process,
vol. 25, no. 1, pp. 113–121, Jan. 1984, doi: 10.1016/0734-189X(84)90051-3.
[14] P. Manuel, R. Bharati, I. Rajasingh, and C. Monica M, “On minimum metric dimension of
honeycomb networks,” Journal of Discrete Algorithms, vol. 6, no. 1, pp. 20–27, Mar. 2008, doi:
10.1016/J.JDA.2006.09.002.
[15] B. Rajan, I. Rajasingh, P. M.-P. of the F. International, and undefined 2006, “On Minimum Metric
Dimension of Circulant Networks,” Citeseer, Accessed: Oct. 21, 2022. [Online]. Available:
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.799.9558&rep=rep1&type=pdf
[16] M. Fehr, S. Gosselin, and O. R. Oellermann, “The metric dimension of Cayley digraphs,” Discrete
Math, vol. 306, no. 1, pp. 31–41, Jan. 2006, doi: 10.1016/j.disc.2005.09.015.

Dimension Metric for snowflake graph

 Muhammad Rafif Fajri, et al. 14

[17] H. Iswadi, E. T. Baskoro, R. Simanjuntak, and A. N. M. Salman, “The metric dimension of graph
with pendant edges,” The Journal of Combinatorial Mathematics and Combinatorial Computing, vol.
65, pp. 139–145, 2008.
[18] I. Tomescu and I. Javaid, “On the metric dimension of the Jahangir graph,” Bulletin mathématique de
la Société des Sciences Mathématiques de Roumanie, pp. 371–376, 2007.
[19] H. Iswadi, E. T. Baskoro, A. N. M. Salman, and R. Simanjuntak, “The metric dimension of
amalgamation of cycles,” Far East Journal of Mathematical Sciences (FJMS), vol. 41, no. 1, pp. 19–
31, 2010.
[20] M. Bača, E. T. Baskoro, A. N. M. Salman, S. W. Saputro, and D. Suprijanto, “The metric dimension
of regular bipartite graphs,” Bulletin mathématique de la Société des Sciences Mathématiques de
Roumanie, pp. 15–28, 2011.
[21] H. Iswadi, E. T. Baskoro, and R. Simanjuntak, “On the metric dimension of corona product of
graphs,” Far East Journal of Mathematical Sciences (FJMS), vol. 52, no. 2, pp. 155–170, 2011.
[22] S. W. Saputro et al., “The metric dimension of the lexicographic product of graphs,” Discrete Math,
vol. 313, no. 9, pp. 1045–1051, May 2013, doi: 10.1016/J.DISC.2013.01.021.
[23] M. Imran, “On the metric dimension of barycentric subdivision of Cayley graphs,” Acta Math Appl
Sin, vol. 32, no. 4, pp. 1067–1072, Oct. 2016, doi: 10.1007/s10255-016-0627-0.
[24] P. Singh et al., “Metric dimension and edge metric dimension of windmill graphs,” AIMS
Mathematics 2021 9:9138, vol. 6, no. 9, pp. 9138–9153, 2021, doi: 10.3934/MATH.2021531.
[25] J. Wu, L. Wang, and W. Yang, “Learning to compute the metric dimension of graphs,” Appl Math
Comput, vol. 432, p. 127350, Nov. 2022, doi: 10.1016/j.amc.2022.127350.
[26] S. Akhter and R. Farooq, “Metric dimension of fullerene graphs,” Electronic Journal of Graph Theory
and Applications (EJGTA), vol. 7, no. 1, pp. 91–103, Apr. 2019, doi: 10.5614/EJGTA.2019.7.1.7.
[27] J. Bensmail, F. Mc Inerney, and N. Nisse, “Metric dimension: From graphs to oriented graphs,”
Discrete Appl Math (1979), Sep. 2020, doi: 10.1016/j.dam.2020.09.013.
[28] B. Sooryanarayana, S. Kunikullaya, and N. N. Swamy, “Metric dimension of generalized wheels,”
Arab Journal of Mathematical Sciences, vol. 25, no. 2, pp. 131–144, Jul. 2019, doi:
10.1016/j.ajmsc.2019.04.002.
[29] S. Klavžar, F. Rahbarnia, and M. Tavakoli, “Some binary products and integer linear programming
for k-metric dimension of graphs,” Appl Math Comput, vol. 409, p. 126420, Nov. 2021, doi:
10.1016/J.AMC.2021.126420.
[30] Z. Jiang and N. Polyanskii, “On the metric dimension of Cartesian powers of a graph,” J Comb
Theory Ser A, vol. 165, pp. 1–14, Jul. 2019, doi: 10.1016/J.JCTA.2019.01.002.
[31] J. Komjáthy and G. Ódor, “Metric dimension of critical Galton–Watson trees and linear preferential
attachment trees,” European Journal of Combinatorics, vol. 95, p. 103317, Jun. 2021, doi:
10.1016/j.ejc.2021.103317.
[32] A. Kelenc, N. Tratnik, and I. G. Yero, “Uniquely identifying the edges of a graph: The edge metric
dimension,” Discrete Appl Math (1979), vol. 251, pp. 204–220, Dec. 2018, doi:
10.1016/J.DAM.2018.05.052.
[33] F. Okamoto, B. Phinezy, and P. Zhang, “The local metric dimension of a graph,” Mathematica
Bohemica, vol. 135, no. 3, pp. 239–255, 2010, doi: 10.21136/MB.2010.140702.

http://www.eksakta.ppj.unp.ac.id/index.php/eksakta
 Eksakta : Berkala Ilmiah Bidang MIPA ISSN : 1411 3724 15

[34] M. Knor, R. Škrekovski, and I. G. Yero, “A note on the metric and edge metric dimensions of 2-
connected graphs,” Discrete Appl Math (1979), vol. 319, pp. 454–460, Oct. 2022, doi:
10.1016/j.dam.2021.02.020.
[35] K. Sharma, V. K. Bhat, and S. K. Sharma, “Edge Metric Dimension and Edge Basis of One-
Heptagonal Carbon Nanocone Networks,” IEEE Access, vol. 10, pp. 29558–29566, 2022, doi:
10.1109/ACCESS.2022.3158982.
[36] S. Klavžar and M. Tavakoli, “Edge metric dimensions via hierarchical product and integer linear
programming,” Optimization Letters 2020 15:6, vol. 15, no. 6, pp. 1993–2003, Nov. 2020, doi:
10.1007/S11590-020-01669-X.
[37] J. Sedlar and R. Škrekovski, “Vertex and edge metric dimensions of cacti,” Discrete Appl Math
(1979), vol. 320, pp. 126–139, Oct. 2022, doi: 10.1016/J.DAM.2022.05.008.
[38] J. Sedlar and R. Škrekovski, “Vertex and edge metric dimensions of unicyclic graphs,” Discrete Appl
Math (1979), vol. 314, pp. 81–92, Jun. 2022, doi: 10.1016/j.dam.2022.02.022.
[39] S. Klavžar and M. Tavakoli, “Local metric dimension of graphs: Generalized hierarchical products
and some applications,” Appl Math Comput, vol. 364, p. 124676, Jan. 2020, doi:
10.1016/J.AMC.2019.124676.
[40] G. Abrishami, M. A. Henning, and M. Tavakoli, “Local metric dimension for graphs with small
clique numbers,” Discrete Math, vol. 345, no. 4, p. 112763, Apr. 2022, doi:
10.1016/j.disc.2021.112763.
[41] R. M. Frongillo, J. Geneson, M. E. Lladser, R. C. Tillquist, and E. Yi, “Truncated metric dimension
for finite graphs,” Discrete Appl Math (1979), vol. 320, pp. 150–169, Oct. 2022, doi:
10.1016/J.DAM.2022.04.021.
[42] J. Sedlar and R. Škrekovski, “Metric dimensions vs. cyclomatic number of graphs with minimum
degree at least two,” Appl Math Comput, vol. 427, p. 127147, Aug. 2022, doi:
10.1016/j.amc.2022.127147.
[43] E. Yi, “On the edge dimension and the fractional edge dimension of graphs,” Discrete Appl Math
(1979), Aug. 2022, doi: 10.1016/j.dam.2022.07.014.
[44] L. Susilowati, I. Sa’adah, R. Z. Fauziyyah, A. Erfanian, and Slamin, “The dominant metric dimension
of graphs,” Heliyon, vol. 6, no. 3, p. e03633, Mar. 2020, doi: 10.1016/j.heliyon.2020.e03633.
[45] L. Susilowati, R. A. Slamin, and A. Rosfiana, “The complement metric dimension of graphs and its
operations,” Int. J. Civ. Eng. Technol, vol. 10, no. 3, pp. 2386–2396, 2019.
[46] M. Wei, J. Yue, and L. Chen, “The effect of vertex and edge deletion on the edge metric dimension of
graphs,” J Comb Optim, vol. 44, no. 1, pp. 331–342, Aug. 2022, doi: 10.1007/s10878-021-00838-7.
[47] J. Geneson, S. Kaustav, and A. Labelle, “Extremal results for graphs of bounded metric dimension,”
Discrete Appl Math (1979), vol. 309, pp. 123–129, Mar. 2022, doi: 10.1016/j.dam.2021.11.015.
[48] S. Mashkaria, G. Ódor, and P. Thiran, “On the robustness of the metric dimension of grid graphs to
adding a single edge,” Discrete Appl Math (1979), vol. 316, pp. 1–27, Jul. 2022, doi:
10.1016/J.DAM.2022.02.014.
[49] J. E. Lawson, “Hands-on Science: Light, Physical Science (matter)-Chapter 5: The Colors of Light.
Portage & Main Press,” ISBN 9781894110631. Retrieved, pp. 6–28, 2009.
[50] G. Chartrand, L. Lesniak, and P. Zhang, Graphs & Digraphs. Chapman and Hall/CRC, 2015. doi:
10.1201/b19731.
 

Dimension Metric for snowflake graph