Present As I

Motivation Definition Application Game Conclusion Daftar Pustaka
3.26pt
THE METRIC DIMENSION OF A GRAPH
Week 14
Deddy Rahmadi, S.Si., M.Sc
Undergraduate Programme of Mathematics

Faculty of Science and Technologies
UIN Sunan Kalijaga
December 6, 2021
Preliminaries
Time Line
Week 16 Final Examination
Week 15 Magic Labeling
Week 14 Metric Dimension
Week 13 Coloring Graph
Week 12 Planar Graph

Time Line
Week 16 Final Examination
Week 15 Magic Labeling
Week 14 Metric Dimension
Week 13 Coloring Graph
Week 12 Planar Graph

LLO
Lesson Learning Outcome (LLO)

Students are able to apply concept of metric dimension to solve problems
(Lecture 14).
Indicator(Lecture 14)
1 Students are able to understand the metric dimension concept.
2 Students are able to implement metric dimension to some graph classes.
3 Students are able to use metric dimension in real life.
Outline
3.26pt
1 Motivation
2 Definition
3 Application
4 Game
5 Conclusion
6 Daftar Pustaka
Quotes
Motivation
Motivation
Suppose we have a mosque.

Motivation
Short circuit can cause a fire.

Motivation
Is it efficient to place fire detector in all rooms?

Motivation
Suppose we have a mosque.

How we place fire detector as minimum as possible?
The Metric Dimension
Graph
Graph
Let G be a connected and simple graph of order n.
Graph
The distance d(u, v ) between two vertices u and v of G is the length of a
shortest u − v path in G.
Graph
For an example :
v4 v1 v2
v5 v3
Figure: Graf G
v1 − v5 path is v1 , v1 v2 , v2 , v2 v5 , v5
Graph
For an example :
v4 v1 v2
v5 v3
Figure: Graf G
v1 − v5 path is v1 , v1 v2 , v2 , , v2 v3 , v3 , v2 v5 , v5
Graph
For an example :
v4 v1 v2
v5 v3
Figure: Graf G
v1 − v5 path is v1 , v1 v2 , v2 , , v2 v3 , v3 , v2 v5 , v5
d(v1 , v5 ) = 2
Definition
Definition
For an ordered set S = {s1 , s2 , . . . , sk } ⊆ V (G) and a vertex v of G we refer
to the k -vector
r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

Definition
to the k -vector
r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))
as the metric representation of v with respect to S. The set S is called

resolving set for G if every pair of vertices u and v of G, r (u|S) ̸= r (v |S).
Definition
to the k -vector
r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

A resolving set with minimum cardinality called basis and the number of
vertices in basis is called metric dimension denoted by dim(G).
Definition
to the k -vector
r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

Theorem 2.1
A connected graph of order n ≥ 2 has dimension n − 1 if and only if G = Kn
Theorem 2.2
A connected graph of order n has dimension 1 if and only if G = Pn

Placing a Fire Detector
We have a mosque layout with seven rooms. We need to place the fire
detector as minimum as possible.
We have a mosque layout with seven rooms. We need to place the fire
detector as minimum as possible.
Let the vertex represent room and edge represent connection between room
that connected with the door.

Middle Terrace : v1 , North Terrace : v2 , South Terrace : v3 , Main Room : v4 ,

Wudhu place for Woman : v5 , Storage room : v6 , and Wudhu place for Man :
v7 .
We have graph representation as follows named Graph M.
Graph Representation
v5 v2
v6 v4 v1
v7 v3
Figure: Graph M
We have graph M with 7 vertices and 6 edges.

Graph Representation
v5 v2
v6 v4 v1
v7 v3
Figure: Graph M
We have graph M with 7 vertices and 6 edges.

Because graph M is not same with graph path, we consider that the metric
dimension of graph M is at least 2.
The Metric Dimension of a Graph
Figure: Graph M
Let S1 = {v1 , v7 }
Figure: Graph M
Let S1 = {v1 , v7 }
r (v1 |S1 ) = (0, 2) r (v2 |S1 ) = (1, 3) r (v3 |S1 ) = (1, 1)
r (v4 |S1 ) = (1, 2) r (v5 |S1 ) = (2, 4) r (v6 |S1 ) = (2, 3)
r (v7 |S1 ) = (2, 0)
S1 is a resolving set.
Figure: Graph M
Let S1 = {v1 , v7 }
r (v1 |S1 ) = (0, 2) r (v2 |S1 ) = (1, 3) r (v3 |S1 ) = (1, 1)
r (v4 |S1 ) = (1, 2) r (v5 |S1 ) = (2, 4) r (v6 |S1 ) = (2, 3)
r (v7 |S1 ) = (2, 0)
S1 is a resolving set. Because S1 is a resolving set with minimum cardinality,
so we have dim(M) = 2. (Theorem 2.2)
v5 v2
v6 v4 v1
v7 v3
Figure: Graph M
We have the location of fire detector is in v1 dan v7 .

Vertex v1 dan v7 represent Middle Terrace and Wudhu place for Man
The Other Application



Quiz
Quiz Results
Summary
Let G be a connected and simple graph of order n

For an ordered set W = {w1 , w2 , . . . , wk } ⊆ V (G) and a vertex v of G we
refer to the k-vector
r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))

Summary

r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))

Summary

r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))


The metric dimension of a graph can be represented a minimum number of
fire detector in a building, in this case the building is a mosque. The minimum
resolving set showing the room that will be installed fire detectors. In this
case, we must set two fire detector in Middle Terrace and Wudhu place for
Man
Task
1. Go to Mosque near your house. (With health protocol)

2. Draw the layout.
3. Make a graph representation.
4. Count the minimum number of fire detector that can be installed on the
mosque.
5. Recommend your result.
Lecture 15 : Magic Graph
Subject matters :
Magic Graph
Magic Labeling
Lecture note will be uploaded on December 8, 2020 at 8.00 a.m. Please
check E.L.A’s e-classroom once it’s available.
Discussion
Private discussion : deddyrahmadi07@gmail.com

Group discussion : Google Classroom
Bondy, J.A. dan U.S.R. Murty, 2008, Graph Theory, Springer.

Chartrand, G., L. Eroh, M. A. Johnson, dan O.R. Oellermann, 2000,
Resolvability in Graphs and the Metric Dimension of Graph, Discrete
Appl. Math., 105, pp. 99-113.
Chartrand, G. dan L. Lesniak, 1979, Graphs and Digraphs 2nd edition,
Wadsworth, Inc., California.
Hulme, B. L., A. W. Shiver, dan P.J. Slater, 1984, A Boolean Algebraic
Analysis of Fire Protection, North-Holland Mathematics Studies, 95, pp.
215-227.
Khuller, S., B. Raghavachari, dan A, Rosenfeld, 1996, Landmarks in
Graphs, Discrete Appl. Math., 70, pp.230-236.
Slater, P.J., Dominating and Reference Sets in Graph, 1988, Journal of
Mathematical and Physical Sciences, 22, pp. 445-455.
Wallis, W. D., Magic Graph, Birkhauser, Boston, Basel, Berlin, 2001

Present As I

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Present As I

Uploaded by

Copyright:

Available Formats

Motivation Definition Application Game Conclusion Daftar Pustaka

THE METRIC DIMENSION OF A GRAPH

Deddy Rahmadi, S.Si., M.Sc

Undergraduate Programme of Mathematics

Week 16 Final Examination

Week 15 Magic Labeling

Week 14 Metric Dimension

Week 13 Coloring Graph

Week 12 Planar Graph

Week 16 Final Examination

Week 15 Magic Labeling

Week 14 Metric Dimension

Week 13 Coloring Graph

Week 12 Planar Graph

Lesson Learning Outcome (LLO)

Suppose we have a mosque.

Short circuit can cause a fire.

Is it efficient to place fire detector in all rooms?

Suppose we have a mosque.

The Metric Dimension

The Metric Dimension

The Metric Dimension

The Metric Dimension

The Metric Dimension

The Metric Dimension

The Metric Dimension

The Metric Dimension

r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

The Metric Dimension

r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

as the metric representation of v with respect to S. The set S is called

The Metric Dimension

r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

as the metric representation of v with respect to S. The set S is called

The Metric Dimension

r (v | W ) = (d(v , s1 ), d(v , s2 ), ..., d(v , sk ))

as the metric representation of v with respect to S. The set S is called

A connected graph of order n ≥ 2 has dimension n − 1 if and only if G = Kn

A connected graph of order n has dimension 1 if and only if G = Pn

Placing a Fire Detector

Placing a Fire Detector

Placing a Fire Detector

Placing a Fire Detector

Middle Terrace : v1 , North Terrace : v2 , South Terrace : v3 , Main Room : v4 ,

We have graph M with 7 vertices and 6 edges.

We have graph M with 7 vertices and 6 edges.

The Metric Dimension of a Graph

The Metric Dimension of a Graph

The Metric Dimension of a Graph

The Metric Dimension of a Graph

We have the location of fire detector is in v1 dan v7 .

The Other Application

The Other Application

The Other Application

Let G be a connected and simple graph of order n

r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))

Let G be a connected and simple graph of order n

r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))

as the metric representation of v with respect to S. The set S is called

Let G be a connected and simple graph of order n

r (v | W ) = (d(v , w1 ), d(v , w2 ), ..., d(v , wk ))

as the metric representation of v with respect to S. The set S is called