Plagiarism Checker X Originality Report

Similarity Found: 2%

Date: Tuesday, August 28, 2018

Statistics: 80 words Plagiarized / 4386 Total words
Remarks: Low Plagiarism Detected - Your Document needs Optional Improvement.
-------------------------------------------------------------------------------------------

Bulle tin of Mathem atic s ISSN Printed : 208 7-51 26; O nlin e: 2 355-8 202 Vo l. 08 , No.
0 2 (2 016), pp. 117-1 24 htt p:// ju rnal.b ull-m ath .org THE M ETR IC DIME NSION OF
FRIE ND SHIP GRAPH F n , LOLLIPOP GRAPH L m , n AND PETE RSEN GRAPH P n , m
Mulyono a nd Wula nda ri Abstr ac t. Let u an d v are vertic es in conn ected grap h G,
the d istan ce d ( u, v ) is th e len gth o f t he sh ortest path b e twee n the verti ces u an
dv.

Fo r an o rdere d sub set W = { w 1 , w 2 , w 3 , . . . , w k } of vert ices in a conn ecte d

grap h G an d a vert ex v ? V ( G ), a m etric repre sentati on of v wi th resp e ct to W is t
he k - vec tor r ( v | W ) = ( d ( v , w 1 ) , d ( v , w 2 ) , . . . , d ( v , w k )).

The sub set W is a reso lvi ng se t if r ( v | W ) for eve ry two vert ices of G have d istin ct
repre sentatio ns. T he mi nimum c ardin ality o f reso lving set for G is ca lled th e met
ric dim ensi on of G an d deno ted by dim ( G ). Thi s pa p e r is devoted to de termi ne
th e met ric di mens ion o f frien dship grap h F n , lo llip op gra ph L m,n an d Pete rsen
graph P n,m for m = 1. f5.

1. INTRODUCTION Metric dime ns ion is one of sub jects in graph theory. The proble m
of s tudying the m etric dime ns ion was ?rstly intro duced by Slate r in 1975. Harary and
Me lter [6] prop os ed the s ame conce pt in the ir pap e r ’On the Metric Dime ns ion of
a Graph’. This pap e r fo cuse d on a conce pt name ly me tric represe ntation that is a
way to repres ent ve rte x lo cation in a graph.

Let u and v are ve rtice s in conne cte d graph G, the dis tanc e d ( u, v ) is the le ngth of
the shorte st path b etwee n the vertic es u and v . For an Received 1 6-08 -201 6, Acce
pted 21- 09-20 16. 2010 M athematics Su bject Classi ?cation : 0 5C2 0, 94 C12 Key
words and Phrases : resol vin g se t, basis , m etric dim ens ion, friend ship grap h, lolli p
o p g raph, Pete rsen graph 117 Mulyono & Wul andari – Metric Dim ensi on 118 orde
re d subs et W = { w 1 , w 2 , w 3 , . . .

, w k } of vertice s in a conne cte d graph G and a ve rte x v ? V ( G ), the me tric re pres

entation of v with re sp e ct to W is the k - vec tor r ( v | W ) = ( d ( v , w 1 ) , d ( v , w 2 ) ,
. . . , d ( v , w k )). The following de?nition ab out metric dime ns ion was prop ose d by
Harary and Me lte r [6]. De?niti on 1. 1 The subset W is a resolving set if r ( v | W ) for
every t wo vertices of G have dist inct represent ations.

A resolving set of minimum cardin ality for graph G is cal led a minimum resolving set o
r a basis for G . The metric dimension of G , denot ed by dim ( G ) , is the n umber of
basis for G . The concept of me tric dim ension has proved to b e use ful in a variety of
?e lds .

Chartrand et al [2] applied the re solving s et of m etric dim ension in che mistry to class
ify the chemic al com p ound. Khulle r et al [12] als o applie d in rob otic navigation.
Furthermore, Seb o e t al [11] applie d in c ombinatorial se arch and optimization. More
over Hindayani [7] has studie d the determining m etric dime ns ion of K r + mK s graph.

The re sults are dim ( K r + mK s ) = m + ( r - 2) for m = 2 , s = 1, and dim ( K r + mK s )

= ( s - 1) m + ( r - 1) for m, s = 2. Another work related to the m etric dim ension is prop
ose d by Permana [9] on the de termining metric dime ns ion for som e tre es in s p e
ci?c shap e. He obtained dim ( C m,n ) = m ( n - 1) for m = 1, n = 2, dim ( F m,n ) = m ( n
- 1) for m, n = 2, and dim ( B m,n ) = m ( n - 2) for m = 2, n = 3 .

In this pap er we consider the me tric dim ension of frie ndship graph F n , lollip op
graph L m,n and Pe terse n graph P n,m for m = 1. 2. PRELIMINA RIES A graph G consis
ts of a se t of ob jec ts V ( G ) = { v 1 , v 2 , v 3 , . . . } called vertices and other se t E ( G )
= { e 1 , e 2 , e 3 , . . . } whose elem ents are called edges and graph is usually denote d
as G = ( V ( G ) , E ( G )) [13].

A graph at leas t has one ve rte x and p e rhaps has no e dge . T he numb e r of ve rtice s
in G denote d by | V ( G ) | is ofte n c alle d the order of G , while the numb er of edges
denote d by | E ( G ) | is its size [4]. The e dge e = ( u, v ) is de note d to join the ve rtic es
u and v .

If e = ( u, v ) is an e dge of a graph G , then u and v are adjacent vertices , w hile u and e

are incident , as are v and e [3]. For a conne cted graph G , we de ?ne the distance d ( u,
v ) b e twe en two vertice s u and v as the minimum of the lengths of the u - v paths of
G . Mulyono & Wul andari – Metric Dim ensi on 119 d ( u, v ) = 0 for all pairs u, v of
vertic es of G , and d ( u, v ) = 0 if and only if u = v [3].

A friendship gra ph F n is a graph that can b e construc te d by c oale sc ence n copies

of the c ycle graph C 3 of length 3 with a c omm on vertex. T he friendship graph F n is
also planar graph w ith 2 n + 1 ve rtice s and 3 n edges . The ve rtic es s et is V ( F n ) = {
c, v 1 , v 2 , v 2 , , v 2 n } and the e dge s s et is E ( F n ) = { cv 1 , cv 2 , cv 3 , , cv 2 n } ? { v
1 v 2 , v 3 v 4 , . . . , v 2 i - 1 v 2 i , . . . , v 2 n - 1 v 2 n } for n = 2 [1]. The following ?gure s
hows the friendship graph in com mon.

Figure 1: Friends hip graph F n A lol lipop graph , denoted by L m,n (shown in Figure 2),
is a graph which is constructed by app e nding a c omple te graph K m , m = 3, to a p e
ndant vertex of path graph P n . T he vertices se t de note d as V ( L m,n ) = { u 1 , u 2 , u
3 , . . . , u n , v 1 , v 2 , v 3 , . . . , v m } [10].

Figure 2: Lollip op graph L m,n A Pet ersen graph , de noted by P n,m for n = 3 and 1 =
m = n - 1 2 , is a 3 - regular graph with 2 n vertice s V ( P n,m ) = { u 1 , u 2 , . . . , u n , v 1
, v 2 , . . . , v n } and 3 n edges E ( P n,m ) = { u i u i +1 , u i v i , v i v i + m }? i ? { 1 , 2 , . . . ,
n } , where the subscripts are reduc ed by mo dulo n . The following ?gure shows the Pet
ersen graph P n, 1 .

Mulyono & Wul andari – Metric Dim ensi on 120 Figure 3: Peterse n graph P n, 1 3.
RESULTS 3. 1 T he Me tr ic Di me nsi on o f Fr iendshi p Graph F n We b e gin by
providing a stronge r re sult w hat we indicate d in the prec eding se ction. Theorem 3. 1
For al l in teger n = 2 , dim ( F n ) = n Pro of 3. 1 We ch oose a subset W = { v 1 , v 3 , v 5
,...

, v 2 n - 1 } , and we must show that dim ( F n ) = n for n = 2 . By de?nition 1.1, w e got

the represen ta- tions of vertices in graph F n with respect to W are r ( c | W ) = (1 , 1 , 1 ,
. . . , 1 , 1) r ( v 1 | W ) = (0 , 2 , 2 , . . . , 2 , 2) r ( v 2 | W ) = (1 , 2 , 2 , . . . , 2 , 2) r ( v 3 | W )
= (2 , 0 , 2 , . . . , 2 , 2) r ( v 4 | W ) = (2 , 1 , 2 , . . .

, 2 , 2) r ( v 5 | W ) = (2 , 2 , 0 , . . . , 2 , 2) . . . = . . . r ( v 2 n - 1 | W ) = (2 , 2 , 2 , . . . , 2 , 0) r
( v 2 n | W ) = (2 , 2 , 2 , . . . , 2 , 1) From above, the representat ion s of vertices in graph
F n are d istinct. This impiles t hat W is resolving set, but it is not necessarily the low er
boun d. Thus the upper bound is dim ( F n ) = n .

Now , we show t hat dim ( F n ) = n . Let W = { v 1 , v 3 , v 5 , . . . , v 2 n - 1 } is a resolving

set w hich is | W | = n . Assume t hat W 1 is another mini- mum resolving set or we can
deno te | W 1 | < n . If we choose an ordered set W 1 ? W - { v i } , i is odd, so that there
are two vert ices v i , v i +1 ? F n such that r ( v i | W ) = r ( v i +1 | W ) = (2 , 2 , 2 , . . . , 2 ,
2) . W 1 is n ot a resolving set, a contradiction with assumpt ion . Thus t he low er bound
is dim ( F n ) = n .

From the above proving, we conclude that dim ( F n ) = n . _ Mulyono & Wul andari –
Metric Dim ensi on 121 Thus, anothe r strong re sult is s howed in the follow ing
theorem . 3 .2 T he Me tr ic Di me nsi on o f Lol li p op G raph L m,n Theorem 3. 2 For al l
in teger m = 3 and n = 1 , dim ( L m,n ) = m - 1 Pro of 3.

2 We choose a subset W = { v 1 , v 2 , v 3 , . . . , v m - 1 } , a nd w e must show that dim (

L m,n ) = m - 1 for m = 3 , n = 1 . By de?nition 1.1, w e got the represent ations of
vertices in gra ph L m,n with respect to W are r ( v 1 | W ) = (0 , 1 , 1 , . . . , 1 , 1) r ( v 2 |
W ) = (1 , 0 , 1 , . . . , 1 , 1) r ( v 3 | W ) = (1 , 1 , 0 , . . . , 1 , 1) . . . = . . . r ( v m - 1 | W ) = (1
, 1 , 1 , . . . , 1 , 0) r ( v m | W ) = (1 , 1 , 1 , . . .

, 1 , 1) r ( u 1 | W ) = (1 , 2 , 2 , . . . , 2 , 2) r ( u 2 | W ) = (2 , 3 , 3 , . . . , 3 , 3) r ( u 3 | W ) =
(3 , 4 , 4 , . . . , 4 , 4) . . . = . . . r ( u n - 1 | W ) = ( n - 1 , n , n, . . . , n, n ) r ( v n | W ) = ( n, n
+ 1 , n + 1 , . . . , n + 1 , n + 1) From above, t he represent ations of vertices in graph L
m,n are distinct.

This impiles t hat W is resolving set, but it is not necessarily the low er boun d. Thus the
upper bound is dim ( L m,n ) = m - 1 . Now , w e show t hat dim ( L m,n ) = m - 1 . Let W
= { v 1 , v 2 , v 3 , . . . , v m - 1 } is a resolving set w hich is | W | = m - 1 . Assume t hat W
1 is anot her minimum reso lving set or w e can deno te | W 1 | < m - 1 . If w e choose
an ordered set W 1 ? { v 1 , v 2 , v 3 , . . .

, v m } - { v i , v j } , 1 = i, j = m , i 6 = j , so t hat there are tw o vertices v i , v j ? L m,n

such th at r ( v i | W ) = r ( v j | W ) = (1 , 1 , 1 , . . . , 1 , 1) . W 1 is not a resolving set , a
con tra dict ion w ith assump tio n. Th us the low er bound is dim ( L m,n ) = m - 1 .
From the above proving, we conclude that dim ( F n ) = n . _ We c ontinue to the othe r
strong re sult. 3 .3

T he Me tr ic Di me nsi on o f Pet er se n Graph P n,m Theorem 3. 3 For the Petersen

grap h P n,m we have Mulyono & Wul andari – Metric Dim ensi on 122 (i) dim ( P n,m )
= 2 for m = 1 , n is odd , n = 3 (ii) dim ( P n,m ) = 3 for m = 1 , n is even , n = 3 Pro of 3.

3 Case ( i) Show ed t hat dim ( P n,m ) = 2 for m = 1 , n is odd, n = 3 We choose a subset

W 1 = { u 1 , u k } , k = n +1 2 , an d we must show t hat dim ( P n,m ) = 2 for m = 1 , n is
odd, n = 3 . By de?nition 1.1, we got the represent ations of vertices in grap h P n,m with
respect to W are r ( u 1 | W ) = (0 , k - 1) r ( u 2 | W ) = (1 , k - 2) r ( u 3 | W ) = (2 , k - 3) .
. . = . . . r ( u k | W ) = ( k - 1 , k - 1) r ( u k +1 | W ) = ( k - 1 , 1) . . . = . . .

r ( u n | W ) = (1 , k - 1) r ( v 1 | W ) = (1 , k ) r ( v 2 | W ) = (2 , k - 1) r ( v 3 | W ) = (3 , k -
2) . . . = . . . r ( v k | W ) = ( k , 1) r ( v k +1 | W ) = ( k , 2) . . . = . . . r ( v n | W ) = (2 , k )
From above, the represent ations of vertices in graph P n,m are distin ct. This impiles
that W is resolving set w it h | W | = 2 .

Obtained the upper bo und is dim ( P n,m ) = 2 . For the Pet ersen graph P n,m , t here is
no resolving set that the cardinality is one. Thus t he lower bound is dim ( P n,m ) = 2 .
Obta ined that dim ( P n,m ) = 2 and dim ( P n,m ) = 2 , t herefore dim ( P n,m ) = 2 .
Case ( ii) Show ed that dim ( P n,m ) = 3 for m = 1 , n is even , n = 4 We choose a subset
W = { u 1 , u k , u n } with k = n +2 2 , and w e must show that dim ( P n,m ) = 3 for m =
1 , n is even, n = 4 . By de? nit ion 1.1, we got the represent ations of vertices in gra ph P
n,m with respect to W are Mulyono & Wul andari – Metric Dim ensi on 123 r ( u 1 | W )
= (0 , k - 1 , 1) r ( u 2 | W ) = (1 , k - 2 , 2) r ( u 3 | W ) = (2 , k - 3 , 3) . . . = . . . r ( u k | W )
= ( k - 1 , 0 , k - 2) r ( u k +1 | W ) = ( k - 2 , 1 , k - 3) . . . = . .

. r ( u n | W ) = (1 , n - k , 0) r ( v 1 | W ) = (1 , k , 2) r ( v 2 | W ) = (2 , k - 1 , 3) r ( v 3 | W )
= (3 , k - 2 , 4) . . . = . . . r ( v k | W ) = ( k , 1 , k - 1) r ( v k +1 | W ) = ( k - 1 , 2 , k - 2) . . . =
. . . r ( v n | W ) = (2 , k - 1 , 1) From above, the represent ations of vertices in graph P
n,m are distin ct.

This impiles t hat W is resolving set, but it is not necessarily the low er boun d. Thus the
upper bound is dim ( P n,m ) = 3 . Now , w e show tha t dim ( P n,m ) = 3 . Assume W 1
is anot her min imum reso lving set of P n,m for m = 1 , n is even, n = 4 with | W 1 | < 3 .
If w e choose an ord ered set W 1 ? W - { v k } , so th at t here are the sa me representat
ion s r ( u 2 | W ) = r ( v 1 | W ) = (1 , 2) , r ( u n - 1 | W ) = r ( v n | W ) = (2 , 1) , r ( u k | W
) = r ( v k - 1 | W ) = (2 , 3) , r ( u k +1 | W ) = r ( v k +2 | W ) = (3 , 2) .

W 1 is not a resolvin g set, a contradiction w ith assumption. Thus the low er boun d is
dim ( P n,m ) = 3 . From the above proving, we conclude that dim ( P n,m ) = 3 . _ . This c
omple tes the pro of of of Theorem 3.3 REFER ENCES 1. A. Ab dollahi, S. Janbaz & M. R.
Ob oudi. 2013. Graphs Co spect ral With A Friendship Graph or Its Complement . Tra
nsactions on Combinatorics . 2. G. C hartrand, D. Erwin, G. L. Johns, and P. Zhang.

B oundary vertic es in graphs . Discrete Math ., 263(1-3):2534, 2003. 3. Chartrand, G.,

Linda Le sniak. 1986. App lied an d Algorithmic Graph Theory , Paci?c Graw, C alifornia.
Mulyono & Wul andari – Metric Dim ensi on 124 4. Chartrand, G., Ping Zhang. 2012. A
First Course in Graph Theory , Dove r Publication, Inc ., New York. 5. Go o daire , Edgar
G., Michae l M. Parmente r. 2008.
Discrete Ma thematics with Grap h Theory Third Edition , Paci?c Graw, C alifornia. 6.
Harary and Melter. 1976. On the Me tric Dim ension of A Graph. Com- binatoria 7.
Hindayani. 2011. Dimensi Me trik Graf K r + mK s , m, r, s ? N . Cauchy 8. Ngurah, AAG.,
Edi Try B askoro. 2003. On Magic and Antimagic Lab e l- ing Ge ne raliz ed of Peterse n
Graph. Ut ilit as Math 9. Permana, Angga Budi, Darm a ji. 2012.

Dimensi Metrik Graf Pohon Be n- tuk Te rte ntu. Jurn al Teknik POMITS 10. Siddiq,
Muhammad. Parme nte r. 2014. Pemb e rian Nomor Vertex pada Top ologi Jaringan Graf
Whe el, Graf Helm, dan Graf Lollip op [Skripsi], Unive rs itas Seb elas Maret, Surakarta.
11. Seb o and Tannier. 2004. On Metric Ge ne rators of Graphs. Math. Oper. Res. 12. S.
Khuller, B . Raghavachari and [Link] enfe ld. 1996. Landmarks in Graphs. App l. Ma th. 13.

Vasude v, C. 2006. Graph Theory w ith A pplications , New Age Interna- tional P. Lim ite
d, Bangalore. Mu lyon o : Mathematics Departm ent, Faculty Mathe matics and Natural
Sc ie nc e, Unive rs itas Ne geri Medan. E-mail: mulyono mat@yaho o.c om Wula ndari :
Mathe matics De partme nt, Faculty Mathe matics and Natural Scie nc e, Unive rs itas Ne
geri Medan. E-mail: wulandari 0910@yaho [Link]

INTERNET SOURCES:
-------------------------------------------------------------------------------------------
1% -
[Link]
[Link]
<1% - [Link]
<1% - [Link]
<1% - [Link]
<1% -
[Link]
_unicyclic_graphs
<1% - [Link]
<1% -
[Link]
_Ordinal_Rules
<1% -
[Link]
a_graph
<1% - [Link]
<1% - [Link]
<1% -
[Link]
otationally_Symmetric_Graphs
<1% -
[Link]
U-3-1-5-F-A-2-2-2-2-%CE%BC-R-1-%CE%BC-R-F-A-F-A/
<1% - [Link]
<1% - [Link]
<1% - [Link]
<1% - [Link]