1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Upload
Home
Explore
My Clipboards
My Uploads
Analytics
Account Settings
B
BaboucarrCeesay6

Support
Logout

Home
Explore

Search Submit Search

Upload
B
BaboucarrCeesay6
My Clipboards
My Uploads
Analytics
Account Settings
Support
Logout

We've updated our privacy policy. Click here to review the details. Tap here to review the details.

×
Search
Successfully reported this slideshow.
Your SlideShare is downloading. ×

AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION

OF GRAPHS

Report

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 1/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Fransiskeran
•
Feb. 27, 2018
• 0 likes • 750 views

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 2/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Skip to next slide You can skip to the next slide in 3

Ad

Watch a video ad to continue

Skip to next slide You can skip to the next slide in 3
Ad

Skip to next slide

Ad
Skip to next slide You can skip to the next slide in 3

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 3/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 4/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 5/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 6/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Advertisement

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 7/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 8/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 9/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 10/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 11/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Advertisement

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 12/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Next SlideShares

Upcoming SlideShare

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 13/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

FURTHER RESULTS ON ODD HARMONIOUS GRAPHS

Loading in …3
×

Check these out next

Graph kernels
Luc Brun

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 14/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Master's thesis
Smrati Kumar Katiyar

Paper id 71201961
IJRAT

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 15/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

L(2,1)-labeling
Maria Jomelyn Ylen

EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...

cscpconf

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 16/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Mapping between Discrete Cosine Transform of Type-VI/VII and Discrete Fourier...

IJERA Editor

Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in Graphs

IJERA Editor

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 17/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

2-D array
Swarup Kumar Boro

3 of 10 Ad

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 18/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

3 of 10 Ad

AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Feb. 27, 2018
• 0 likes • 750 views

Report
Download Now Download

Download to read offline

Education

The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric → + Gd
: X × X × X R where X = r(v /W) =
{(d(v,v1
),d(v,v2
),...,d(v,vk
/) v∈V (G))}, denoted Gd
and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if Gd
numbers of pendant edges are added to the non-basis vertices.

Read more

Fransiskeran
Following Follow

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 19/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric → + Gd
: X × X × X R where X = r(v /W) =
{(d(v,v1
),d(v,v2
),...,d(v,vk
/) v∈V (G))}, denoted Gd
and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if Gd
numbers of pendant edges are added to the non-basis vertices.

Read more
Education

Advertisement

Recommended

FURTHER RESULTS ON ODD HARMONIOUS GRAPHS

graphhoc
272 views
•
14 slides

METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK

graphhoc
421 views
•
9 slides

LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFUL
Fransiskeran
150 views
•
8 slides

Radix-3 Algorithm for Realization of Type-II Discrete Sine Transform

IJERA Editor
83 views
•
7 slides

Graph Edit Distance: Basics & Trends

Luc Brun
1.2k views
•
40 slides

New Classes of Odd Graceful Graphs

graphhoc
1.2k views
•
12 slides

50120130406004 2-3
IAEME Publication
407 views
•
23 slides

E-Cordial Labeling of Some Mirror Graphs

Waqas Tariq
507 views
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 20/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
•
6 slides

Advertisement

Advertisement

Recommended

FURTHER RESULTS ON ODD HARMONIOUS GRAPHS

graphhoc
272 views
•
14 slides

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 21/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK

graphhoc
421 views
•
9 slides

LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFUL
Fransiskeran
150 views
•
8 slides

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 22/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Radix-3 Algorithm for Realization of Type-II Discrete Sine Transform

IJERA Editor
83 views
•
7 slides

Graph Edit Distance: Basics & Trends

Luc Brun
1.2k views
•
40 slides

New Classes of Odd Graceful Graphs

graphhoc
1.2k views
•
12 slides

50120130406004 2-3
IAEME Publication
407 views
•
23 slides

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 23/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

E-Cordial Labeling of Some Mirror Graphs

Waqas Tariq
507 views
•
6 slides

More Related Content

Slideshows for you (16)

Graph kernels
Luc Brun
•
598 views

Master's thesis
Smrati Kumar Katiyar
•
383 views

Paper id 71201961
IJRAT
•
26 views

L(2,1)-labeling
Maria Jomelyn Ylen
•
636 views

EXACT SOLUTIONS OF A FAMILY OF

HIGHER-DIMENSIONAL SPACE-TIME
FRACTIONAL KDV-T...
cscpconf
•
90 views

Mapping between Discrete Cosine

Transform of Type-VI/VII and Discrete
Fourier...
IJERA Editor
•
44 views

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 24/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
Algorithmic Aspects of Vertex Geo-
dominating Sets and Geonumber in Graphs
IJERA Editor
•
310 views

2-D array
Swarup Kumar Boro
•
867 views

Survival and hazard estimation of weibull

distribution based on
Alexander Decker
•
256 views

Paper id 71201925
IJRAT
•
11 views

Performance Improvement of Vector

Quantization with Bit-parallelism Hardware
CSCJournals
•
262 views

Entropy 19-00079
Mazharul Islam
•
80 views

A lattice-based consensus clustering

Dmitrii Ignatov
•
529 views

Interval Pattern Structures: An introdution

INSA Lyon - L'Institut National des
Sciences Appliquées de Lyon
•
475 views

Hierarchical clustering techniques

Md Syed Ahamad
•
251 views

A fixed point theorem for weakly c

contraction mappings of integral type.
Alexander Decker
•
690 views

Graph kernels
Luc Brun
598 views
•
59 slides

Master's thesis
Smrati Kumar Katiyar
383 views
•
36 slides

Paper id 71201961
IJRAT
26 views
•
3 slides

L(2,1)-labeling
Maria Jomelyn Ylen
636 views
•
45 slides

EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...

cscpconf
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 25/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
90 views
•
11 slides

Mapping between Discrete Cosine Transform of Type-VI/VII and Discrete Fourier...

IJERA Editor
44 views
•
3 slides

Similar to AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS (20)

METRIC DIMENSION AND

UNCERTAINTY OF TRAVERSING
ROBOTS IN A NETWORK
Fransiskeran
•
45 views

Algorithmic Aspects of Vertex Geo-

dominating Sets and Geonumber in Graphs
IJERA Editor
•
26 views

DISTANCE TWO LABELING FOR

MULTI-STOREY GRAPHS
graphhoc
•
73 views

An analysis between exact and approximate

algorithms for the k-center proble...
IJECEIAES
•
4 views

GREY LEVEL CO-OCCURRENCE

MATRICES: GENERALISATION AND
SOME NEW FEATURES
ijcseit
•
25 views

STATE SPACE GENERATION

FRAMEWORK BASED ON BINARY
DECISION DIAGRAM FOR DISTRIB...
cscpconf
•
60 views

STATE SPACE GENERATION

FRAMEWORK BASED ON BINARY
DECISION DIAGRAM FOR DISTRIB...
csandit
•
266 views

Generarlized operations on fuzzy graphs

Alexander Decker
•
479 views

FURTHER RESULTS ON ODD

HARMONIOUS GRAPHS
Fransiskeran
•
48 views

ALEXANDER FRACTIONAL
INTEGRAL FILTERING OF WAVELET
COEFFICIENTS FOR IMAGE DEN...
sipij
•
239 views

Network Theory
alomelo_bit
•
745 views
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 26/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Steven Duplij, Raimund Vogl, "Polyadic

Braid Operators and Higher Braiding Ga...
Steven Duplij (Stepan Douplii)
•
78 views

graph theory
Shashank Singh
•
2.1k views

Planted Clique Research Paper

Jose Andres Valdes
•
191 views

Graph theory concepts complex networks

presents-rouhollah nabati
nabati
•
2.7k views

A Subgraph Pattern Search over Graph

Databases
IJMER
•
361 views

A Hough Transform Based On a Map-

Reduce Algorithm
IJERA Editor
•
48 views

ON ALGORITHMIC PROBLEMS
CONCERNING GRAPHS OF HIGHER
DEGREE OF SYMMETRY
Fransiskeran
•
54 views

Triggering patterns of topology changes in

dynamic attributed graphs
INSA Lyon - L'Institut National des
Sciences Appliquées de Lyon
•
2.1k views

On algorithmic problems concerning graphs

of higher degree of symmetry
graphhoc
•
339 views

METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK

Fransiskeran
45 views
•
9 slides

Algorithmic Aspects of Vertex Geo-dominating Sets and Geonumber in Graphs

IJERA Editor
26 views
•
3 slides

DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHS

graphhoc
73 views
•
18 slides

An analysis between exact and approximate algorithms for the k-center proble...
IJECEIAES
4 views
•
8 slides

GREY LEVEL CO-OCCURRENCE MATRICES: GENERALISATION AND SOME NEW FEATURES

ijcseit
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 27/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
25 views
•
7 slides

STATE SPACE GENERATION FRAMEWORK BASED ON BINARY DECISION DIAGRAM FOR DISTRIB...
cscpconf
60 views
•
9 slides

Advertisement

More from Fransiskeran (9)

SELECTIVE WATCHDOG TECHNIQUE

FOR INTRUSION DETECTION IN
MOBILE AD-HOC NETWORK
Fransiskeran
•
56 views

EQUIVALENT CONDITION AND TWO

ALGORITHMS FOR HAMILTONIAN
GRAPHS
Fransiskeran
•
36 views

IMPACT OF ENERGY AND LINK

QUALITY INDICATOR WITH LINK
QUALITY ESTIMATORS IN W...
Fransiskeran
•
64 views

CA-MWSN: CLUSTERING
ALGORITHM FOR MOBILE WIRELESS
SENOR NETWORK
Fransiskeran
•
57 views

EVEN GRACEFUL LABELLING OF A

CLASS OF TREES
Fransiskeran
•
204 views

SWARM INTELLIGENCE FROM

NATURAL TO ARTIFICIAL SYSTEMS:
ANT COLONY OPTIMIZATION
Fransiskeran
•
87 views

A NOVEL INTRUSION DETECTION

SYSTEM FOR DETECTING BLACK-
HOLE NODES IN MANETS
Fransiskeran
•
51 views

The Neighborhood Broadcast Problem in

Wireless Ad Hoc Sensor Networks
Fransiskeran
•
39 views

9217graphhoc01
Fransiskeran
•
148 views

SELECTIVE WATCHDOG TECHNIQUE FOR INTRUSION DETECTION IN MOBILE AD-HOC NETWORK

Fransiskeran

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 28/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
56 views
•
13 slides

EQUIVALENT CONDITION AND TWO ALGORITHMS FOR HAMILTONIAN GRAPHS

Fransiskeran
36 views
•
6 slides

IMPACT OF ENERGY AND LINK QUALITY INDICATOR WITH LINK QUALITY ESTIMATORS IN W...
Fransiskeran
64 views
•
10 slides

CA-MWSN: CLUSTERING ALGORITHM FOR MOBILE WIRELESS SENOR NETWORK

Fransiskeran
57 views
•
7 slides

EVEN GRACEFUL LABELLING OF A CLASS OF TREES

Fransiskeran
204 views
•
7 slides

SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION

Fransiskeran
87 views
•
9 slides

Recently uploaded (20)

Question 22 Which one of the following

statements is true about using.docx
rtodd432
•
0 views

Question 3- chap 120- sect 8- part 1 of 1 9

points A 0-0457 kg ingot o.docx
rtodd432
•
0 views

QUESTION 3 What kind of orbitals are

used in a C-C bond- O sp3 QUESTIO.docx
rtodd432
•
0 views

Question 2 options- Future Value of a

Lump-Sum Rate of interest per pe.docx
rtodd432
•
0 views

CPI feedback
SEBASTIANGONZALEZ624512
•
0 views

Question 3 - What is the pH of a 0-129 M

solution of the acid HA if it.docx
rtodd432
•
0 views

Question 2 Which one of the followings

determines the difference betwe.docx
rtodd432
•
0 views

Question 28 _____ gives employees a series

of job assignments in vario.docx
rtodd432
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 29/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
•
0 views

Sebastian Gonzalez viva grid 2022 .docx

SEBASTIANGONZALEZ624512
•
0 views

Question 3- During NASA-'s Microgravity

Science Laboratory- which flew.docx
rtodd432
•
0 views

BECA340_Ch 16-Sound-J
[Autosaved].pptx
VinayShrivatsava
•
0 views

Question 3 If your vision is improved with

lenses that look like the o.docx
rtodd432
•
0 views

QUESTION 29 1 poi Which of the

following has the highest buffer
capaci.docx
rtodd432
•
0 views

Question 2 For the Mixing Department-

unit materials cost is $8 and un.docx
rtodd432
•
0 views

TIME SERIES
AryanMohanty4
•
0 views

Blood-Composition.pdf
KaleemRajpoot3
•
0 views

Question 21 2 pts What is the molar mass of

-204 L of gas at STP- if t.docx
rtodd432
•
0 views

Sebastian Dante Gonzalez Leeds Uni cover

Letter.docx
SEBASTIANGONZALEZ624512
•
0 views

QUESTION 3 Using classes- data- methods

and constructors- write a prog.docx
rtodd432
•
0 views

QUESTION 3 Associate each application

with the type of transmisision-.docx
rtodd432
•
0 views

Question 22 Which one of the following statements is true about using.docx

rtodd432
0 views
•
1 slide

Question 3- chap 120- sect 8- part 1 of 1 9 points A 0-0457 kg ingot o.docx

rtodd432
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 30/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
0 views
•
2 slides

QUESTION 3 What kind of orbitals are used in a C-C bond- O sp3 QUESTIO.docx
rtodd432
0 views
•
1 slide

Question 2 options- Future Value of a Lump-Sum Rate of interest per pe.docx

rtodd432
0 views
•
2 slides

CPI feedback
SEBASTIANGONZALEZ624512
0 views
•
3 slides

Question 3 - What is the pH of a 0-129 M solution of the acid HA if it.docx

rtodd432
0 views
•
2 slides

Advertisement

Related Books
Free with a 30 day trial from Scribd

See all

The Mathematica Handbook Martha L Abell

(5/5)

Understanding Vector Calculus: Practical Development and Solved Problems Jerrold Franklin
(0/5)

Complex Variables Robert B. Ash

(5/5)

Vectors and Matrices for Geometric and 3D Modeling Michael Mortenson

(0/5)

Geometric functions in computer aided geometric design Oscar Ruiz

(0/5)

A-level Maths Revision (Cheeky Revision Shortcuts) Scool Revision

(3.5/5)

Capsule Calculus Ira Ritow

(0/5)

Basic Structured Grid Generation: With an introduction to unstructured grid generation M Farrashkhalvat
(0/5)

The Advanced Geometry of Plane Curves and Their Applications C. Zwikker

(0/5)

Handbook of Famous Plane Curves Using Mathematica Steven Tan

(0/5)

On Applications and Theory of Functional Equations J. Aczél

(0/5)

Harmonic Vector Fields: Variational Principles and Differential Geometry Sorin Dragomir
(5/5)

Statistics Equations (Speedy Study Guides) Speedy Publishing

(0/5)

A Complete Course in Physics ( Graphs ) - First Edition Rajat Kalia

(0/5)

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 31/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Vector and Tensor Analysis with Applications A. I. Borisenko

(3.5/5)

Numerical Analysis of Wavelet Methods A. Cohen

(0/5)

Machine Intelligence and Pattern Recognition

(5/5)

Topology and Geometry for Physicists Charles Nash

(3/5)

Treatise on Analysis J. Dieudonné

(1/5)

3D Graphics Programming Theory Alexander Mesfin

(0/5)

AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

1. 1. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015
DOI:10.5121/jgraphoc.2015.7101 1 AN APPLICATION OF Gd-METRIC SPACES AND METRIC DIMENSION OF GRAPHS Ms. Manjusha R1 and Dr. Sunny
Kuriakose A2 1 Research Scholar, Union Christian College, Aluva, Kerala, India - 683102 2 Dean, Federal Institute of Science and Technology, Angamaly, Kerala,
India - 683577 Abstract The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found applications in optimization, navigation,
network theory, image processing, pattern recognition etc. Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric +→×× RXXXGd : where == )/( WvrX ( ){ })(/),(),...,,(),,( 21 GVvvvdvvdvvd k ∈ , denoted dG and is
used to study metric dimension of graphs. It has been proved that metric dimension of any connected finite simple graph remains constant if dG numbers of pendant
edges are added to the non-basis vertices. Keywords Resolving set, Basis, Metric dimension, Infinite Graphs, dG -metric. 1. Introduction Graph theory has been
used to study the various concepts of navigation in an arbitrary space. A work place can be denoted as node in a graph, and edges denote the connections between
places. The problem of minimum machine (or Robots) to be placed at certain nodes to trace each and every node exactly once is worth investigating. The problem
can be explained using networks where places are interconnected in which, a navigating agent moves from one node to another in the network. The places or nodes
of a network where we place the machines (robots) are called ‘landmarks’. The minimum number of machines required to locate each and every node of the
network is termed as “metric dimension” and the set of all minimum possible number of landmarks constitute “metric basis”. A discrete metric like generalized
metric [14] is defined on the Cartesian product XXX ×× of a nonempty set X into + R is used to expand the concept of metric dimension of the graph. The
definition of a generalized metric space is given in 2.6. In this type of spaces a non-negative real number is assigned to every triplet of elements. Several other
studies relevant to metric spaces are being extended to G-metric spaces. Different generalizations of the usual notion of a metric space were proposed by several
mathematicians such as G¨ahler [17, 18] (called 2-metric spaces) and Dhage [15, 16] (called D-metric spaces) have pointed out that the results cited by G¨ahler are
independent, rather than generalizations, of the corresponding results in metric spaces. Moreover, it was shown that Dhage’s notion of D-metric space is flawed by
errors and most of the results established by him and others are invalid. These facts are determined by Mustafa and Sims [14] to introduce a new concept in the area,
called G-metric space.
2. 2. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 2 The
concept of metric dimension was introduced by P J Slater in [2] and studied independently by Harary and Melter in [3]. Applications of this navigation of robots in
networks are discussed in [4] and in chemistry, while applications to problems of pattern recognition and image processing, some of which involve the use of
hierarchical structures are given in [5]. Besides Kuller et.al. provide a formula and a linear time algorithm for computing the metric dimension of a tree in [1]. On
the other hand Chartrand et.al. in [7] characterize the graph with metric dimension 1, n -1 and n -2. See also in [8] the tight bound on the metric dimension of
unicyclic graphs. Shanmukha and Sooryanarayana [9,10] compute the parameters for wheels, graphs constructed by joining wheels with paths, complete graphs etc.
In 1960’s a natural definition of the dimension of a graph stated by Paul Erdos and state some related problems and unsolved problems in [11]. Some other
application including coin weighing problems and combinatorial search and optimization [12]. The metric dimension of the Cartesian products of graph has been
studied by Peters-Fransen and Oellermann [13]. The metric dimension of various classes of graphs is computed in [3, 4, 5, 9, 10]. In [4, 5] the results of [3] are
corrected and in [9, 10] the results of [5] are refined. 2. Preliminaries The basic definitions and results required in subsequent section are given in this section. 2.1.
Definition A graph ),( EVG = is an ordered pair consisting of a nonempty set )(GVV = of elements called vertices and a set )(GEE = of unordered pair of vertices
called edges. Two vertices )(, GVvu ∈ are said to be adjacent if there is an edge )(GEuv ∈ joining them. The edge )(GEuv ∈ is also said to be incident to vertices
vandu . The degree of a vertex v , denoted by )deg(v is the number of vertices in )(GV adjacent to it. An edge of a graph is said to be a pendant edge if it is incident
with only one vertex of the graph. A uv -path is a sequence of distinct vertices vvvvu no == ,...,, 1 so that 1−iv is adjacent to iv for all , 1i i n≤ ≤ , such a path is said
to be of length n. A uu -path of length n is a cycle denoted by nC . A graph is said to be connected if there is a path between every two vertices. A complete graph is
a simple graph (a graph having no loops and parallel edges) in which each pair of distinct vertices is joined by an edge. 2.2. Definition A graph G is infinite if the
vertex set )(GV is infinite. An infinite graph is locally finite if every vertex has finite degree. An infinite graph is uniformly locally finite if there exists a positive
integer M such that the degree of each vertex is at most M . For example, the infinite path ∞P is both locally finite and uniformly locally finite by taking 2=M . 2.3.
Definition If G is a connected graph, the distance ),( vud between two vertices V(G), ∈vu is the length of the shortest path between them. Let { }kwwwW ,...,, 21=
be an ordered set of vertices of G and let v be
3. 3. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 3 a vertex of
G. The representation )/( Wvr of v respect to W is the k-tuple ( )),(),...,,(),,( 21 kwvdwvdwvd . If distinct vertices of G have distinct representations (co-ordinates)
with respect toW , then W is called a resolving set or location set for G. A resolving set of minimum cardinality is called a basis for G and this cardinality is called
the metric dimension or location number of G and is denoted by dim(G) or ( )Gβ . For each landmark, the coordinate of a node ‘ v ’ in G having the elements equal
to the cardinality of the set W and th i element of coordinate of ‘ v ’ equal to the length of the shortest path from the th i landmark to the vertex ‘ v ’ in G . For
example, consider the graph G of figure 1. The set },{ 211 vvW = is not a resolving set of G Figure 1. Figure 2. Since )/()1,1()/( 1413 WvrWvr == . Similarly, we
can show that a set consisting of two distinct vertices will not give distinct coordinates for the vertices inG . On the other hand, },,{ 3212 vvvW = form a resolving
set for G in figure 2, since the representation for the vertices in G with respect to 2W are ( ) ( ) ( ) ( )1,0,1/,1,1,0/ 2221 == WvrWvr , ( ) ( )0,1,1/ 23 =Wvr , ( ) (
)1,1,1/ 24 =Wvr and it is the minimum resolving set implying that dim( ) 3G = . 2.4. Remark A graph can have more than one resolving set. For example consider
the graph in figure 3. Here we obtained two resolving sets namely {a,b} and {a,c}. Figure 3. A graph with two resolving sets
4. 4. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 4 2.5.
Definition Let X be a nonempty set. A dG - Metric or generalized metric is a function from XXX ×× into + R having the following properties: XzyxzyxzyxGd
∈=== ,,forif0),,( yxXyxyxxGd ≠∈≤ with,allfor),,(0 yzXzyxzyxGyxxG dd ≠∈≤ with,,allfor),,(),,( )variablesthreetheallinsymmetry...(),,(),,(),,( === xzyGyzxGzyxG
ddd & )inequality(Rectangle,,,),,(),,(),,( XazyxzyaGaaxGzyxG ddd ∈∀+≤ 2.6. Illustration Let ),( dX be a metric space. Define +→×× RXXXGd : by ( )=zyxGd ,, ),
(),(),( xzdzydyxd ++ is a dG -metric satisfying the above five conditions. Conversely if ),( dGX is a dG -metric space, it is easy to verify that ),( dGdX is a metric
space where ( ) ( )),,(),,( 2 1 , yyxGyxxGyxd ddGd += For, a) ( ) ( ) 0),,(),,( 2 1 , ≥+= yyxGyxxGyxd ddGd by (ii) b) ( ) ( ) 0),,(),,( 2 1 , =+= xxxGxxxGxxd ddGd by
(i) c) ( ) ( ) ( )xydxxyGxyyGyyxGyxxGyxd dd GddddG ,)),,(),,(( 2 1 ),,(),,( 2 1 , =+=+= by (iv) d) ( ) ( )),,(),,( 2 1 , yyxGyxxGyxd ddGd += [ ]),,(),,(),,(),,( 2 1
yyzGyzzGzzxGzxxG dddd +++≤ ( ) ( )yzdzxd dd GG ,, +≤ Since ),,(),,(),,(),,( xxzGzzyGxxyGyxxG dddd +≤= Similarly ),,(),,(),,( yyzGzzxGyyxG ddd +≤ by (v)

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 32/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
Now we recall a few results already published in [23] 2.7. Theorem [7] The metric dimension of graph G is 1 if and only if G is a path. Figure 4. (black colored
vertices shows the metric basis for ∞P ) 2.8. Theorem [7] If nK is the complete graph with 1>n then 1)( −= nKnβ .
5. 5. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 5 2.9.
Theorem [1] If nC is a cycle of length 2>n , then 2)( =nCβ . 2.9. Theorem [20] If G is an infinite graph with finite metric dimension then it is uniformly locally
finite. The infinite graph ∞2P is uniformly locally finite with metric dimension equal to two. Figure 4. The converse of the above theorem is not true. That is a
uniformly locally finite graph need not have finite metric dimension. For example the infinite comp is uniformly locally finite but its metric dimension is infinite.
Figure 5. 3. Main Results 3.1. Theorem The metric dimension of the graph obtained by adding ‘n’ pendant edges to each of the ‘n’ vertices in the complete graph nK
, 2>n is same as that of nK . Proof: We have ( ) 1−= nKnβ . Let { } { }in vvvvW ,...,, 21= for some nii ≤≤1, be a basis for nK . Since every vertices nK are adjacent
to each other the coordinate of (n-1) vertices ijv j ≠, in W has (n-1) components at which th j component takes the value ‘0’ and the other components are 1’s with
respect to W . Now the vertex Wvi ∉ is adjacent to the vertices in W , its coordinate vector also has (n-1) components and that will be (1,1,…,1). Suppose nmmm
,...,, 21 are the pendant edges added correspondingly to the vertices nvvv ,...,, 21 such that ( ) njuvm jjj ≤≤= 1,, . Let the graph obtained in this way is denoted by
∑+= = n j jn mKK 1 . We know that the coordinate of jv is (1,1,…,0(j th place),1,…,1). So for some j , 1),( =jj uvd and
6. 6. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 6 since every
vertex ( )nKVv∈ are adjacent to jv , 2),( =juvd for all those vertices jvv ≠ . Hence the coordinate of ju will be (2,2,…,1(j th place),2,…,2). That is, the coordinate of
1u is (1,2,…,2), 2u is (2,1,…,2)…, nu is (2,2,…,1) respectively. Thus the vertices in the graph K obtained by adding ‘n’ pendant edges to each of the vertices in nK
has distinct coordinates with respect to W . Therefore W itself is the basis for nK and hence ( ) 1−= nKβ . 3.2. Illustration Consider 5K (Figure 6). Here five pendant
edges 51),,( ≤≤= juvm jjj are added at each of the vertices 54321 and,,,, vvvvv respectively and shown that ( ) 415 5 1 5 =−=      ∑+= =j jmKK ββ .
Figure 6. The following corollary is about infinite graph with constant metric dimension. 3.3. Corollary The above theorem holds for an infinite graph obtained by
adding pendant edges ( ) njuvm jjj ≤≤= 1,, successively at each ju . Thus there exist infinite graphs with finite metric dimension. The development of uniformly
locally finite (ULF)[19] graphs is based on the adjacency operator A acting on the space of bounded sequences defined on the vertices. It has several applications in
spectral theory. The following theorem gives a simple result on uniformly locally finite graph. 3.4. Theorem The infinite graph ∑+= ∞ =1j jn mKK mentioned in
theorem 3.1 is uniformly locally finite graph with finite metric dimension. Proof: By theorem 3.1 ( ) 1)( 1 −=∑+= ∞ = nmKK j jnββ where ( ) ∞≤≤= juvm jjj 1,, .
Since every vertex is adjacent to each other in nK , 1)( −= nvd for )( nKVv∈ and the degree of the vertices ju which is one of the end vertex in each of the edge
added to nK is 2. Now fix a positive integer 1−= nM where 2>n . Then Mvd ≤)( for all Kv ∈ . Thus K is uniformly locally finite.
7. 7. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 7 3.5.
Theorem Let G be connected graph with kG =)(β , { }kvvvW ,...,, 21= be the basis and ( ){ }.)(/)),(),...,,(,,()/( 21 GVvvvdvvdvvdWvrX k ∈== Define generalized
metric or dG -metric +→×× RXXXGd : by ( ) { }),(),,(),,(min,, ,, zydzxdyxdzyxG k RXzyx d rrrrrrrrr rrr ⊆∈ = Where d is the 2-metric defined from +→× RXX by
∑ −= = k i ii yxyxd 1 ),( rr . If mzyxGd =),,( rrr then the metric dimension of the super graph G ~ obtained by adjoining at most m pendant edges to the vertices
Wv∉ is same as that of G with respect toW . That is ( ) ( )GG ββ = ~ . Proof: Let { }kvvvvW ...,,, 321= be the basis forG . Then the coordinate space { })(/),(),...,,(),,
()/( 21 GVvvvdvvdvvdWvr k ∈= . Since kG =)(β , the coordinate of each vertex in G contains ‘k’ components and they are distinct. Let ( ) mzyxGd =,, . Now we
add m pendant edges are added to suitable vertices Wv∉ . Suppose the first pendant edge 1e is added at Wv j ∉ and ( )1 ,1 ej vve = . The coordinate of jv is )),(),...,,
(),,(( 21 kjjj vvdvvdvvd and it is distinct from the coordinate of other vertices in G . Figure 7. Thus the coordinate of 1ev will be )1),(,...,1),(,1),(( 21 +++ kjjj
vvdvvdvvd with respect to W and is different from all other coordinates of the vertices in G since )),(),...,,(),,(( 21 kjjj vvdvvdvvd is distinct from )),(),...,,(),,(( 21
kiii vvdvvdvvd , jini ≠= ,,...,2,1 . Hence keG =+ )( 1β . If the second pendant edge is added at 1ev say ( )21 ,2 ee vve = , then by the same argument as in the case of
1ev , the coordinate of 2ev will be )1),(,...,1),(,1),(( 111 21 +++ keee vvdvvdvvd and it is distinct from all other coordinates )),(),...,,(),,(( 21 kjjj vvdvvdvvd for
1,,...,2,1 ejnj == . Then obviously the coordinate of the new vertex is distinct from all other vertices since each component in the coordinate of 2ev is increased by
one. Thus keeG =++ )( 21β . Suppose the second pendant edge 2e is added to jivi ≠, in 1eG + and ( )2 ,2 ei vve = . Here also the coordinate of 2ev will be )1),(,...,1),
(,1),(( 21 +++ kiii vvdvvdvvd . Hence keeG =++ )( 21β . Therefore the result is true for 2,1=m . Assume that keeeG m =++++ − )....( 121β where ( )lejl vve ,= for
1,...,2,1, −=∉ mlWv j . If me is added at any lev then each of the ‘k’ components in the coordinate of the vertex mev is increased by one and hence it is distinct from
other coordinates. If me is added to any vertex v in G not in W and not the end vertex of any of le , 1,...,2,1 −= ml , then the coordinate of mev will be )1),(,......1),
(,1),(( 21 +++ kvvdvvdvvd and distinct from all other coordinates of the vertices in the super graph 121 .... −++++ meeeG . Thus
8. 8. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 8 keeeeG
mm =+++++ − )....( 121β . Hence the result is true for m . Thus the theorem is true for any integral value of +∈RzyxGd ),,( rrr . 3.6 Example Consider a 5- vertex
Kite say H (Figure 8). There ( ) ( )( ) ( ) ( ){ }2,3,1,2,1,10,1,1,0=X and ( ) { } XzyxzxdzydyxdMinzyxGd ∈= ,,,),(),,(),,(,, r ∑ −== = 2 1 ),(where,2 i ii yxyxd Thus
the minimum number of pendant edges that added to the Kite is 2. If these edges are added to those vertices which are not in W namely 43 and vv with ( ) 221 =++
eeHβ . Figure 8. 3.7. Example Consider 4C ( ) 24 =Cβ with respect to { }21,vvW = (Figure 9). Then ( ) ( ) ( ) ( ){ }1,2,2,1,0,1,1,0)/( == WvrX Figure 9. By the
definition of +→×× RXXXGd : , we have ( ) { } XzyxzxdzydyxdMinzyxGd ∈= ,,,),(),,(),,(,, r ∑ −== = 2 1 ),(where,1 i ii yxyxd So one pendant edge is added to 4C
.Suppose the pendant edge is added at Wv ∈1 and ( )1 ,11 evve = . Then the coordinate of 1ev is (1,2) with respect to W , but that is similar to the coordinate of 3v
(Figure 10). Therefore ( ) WeC respect towith214 ≠+β .
9. 9. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 9 Figure 10.
Similarly if 1e is added to Wv ∈2 , the coordinate of 1ev will be (2,1) and that is similar to the coordinate of 4v (Figure 11). Thus 1e must be added to any of 3v or
4v . It will give a distinct representation for the coordinates of the vertices in 14 eC + (Figure 12). That is 1e must be added to the vertices not in .W Figure 11.
Figure 12. Note: Since W is not unique, ( ) 214 =+ eCβ with respect to another resolving set { }2,1 vvW e= and ( ) ( )( ) ( ) ( ){ }1,3,2,2,0,21,1,2,0)/( =Wvr (Figure
13). Figure 13. 4. Conclusion This paper gives a measure that can be used in navigation space where the number of robots required to navigate a work place kept
constant. Extension of navigation space will lead us to
10. 10. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks(GRAPH-HOC) Vol.7, No.1, March 2015 10 infinite
graphs and its properties. With the help of dG -metric and its properties we established general concepts and results. References [1] J. Caceres, C. Hernado, M.
Mora, I. M. Pelayo, M. L. Puertas, C. Seara and D. R. Wood,“On the Metric Dimension of Some Families of Graphs,” Electronic Notes in Discrete Mathematics,
Vol. 22, 2005, pp. 129-133. [2] P. J. Slater. Leaves of trees. In: Proc. 6th Southeastern Conf. on Combinatorics, Graph Theory and Computing, 14, pp 549-559,
1975. [3] F. Harary and R. A. Melter, “On the Metric Dimension of a Graph,” Ars Combinatorica, Vol. 2, 1976, pp. 191-195. [4] I. Javaid, M. T. Rahim and K. Ali, “
Families of Regular Graphs with constant Metric Dimension,” Utilitas Mathematica, Vol. 75, 2008, pp. 21-33. [5] S. Khuller, B. Raghavachari and A. Rosenfeld,
“Localization in Graphs,” Technical Report CS-Tr- 3326, University of Maryland at College Park, 1994. [6] S. Khuller, B. Raghavachari and A. Rosenfeld.
Landmarks in Graphs. Discrete Appl. Math, 70(3), pp. 217-229, 1996. [7] G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann. Resolvability in graphs and
Metric Dimension of Graph. Discrete Appl. Math., 105(1-3), pp. 99-113, 2000. [8] C. Poisson and P. Zhang. The metric dimension of unicyclic graphs. J. Combin.
Math. Combin. Compute. 40, pp. 17-32, 2002. [9] B Sooryanaranyana, B. Shanmuka, A Note on metric dimension, Far. East Journal of Applied Mathematics, 5,
331-339, 2001. [10] B Sooryanaranyana, B. Shanmuka, Metric dimension of a wheel, Far. East Journal of Applied Mathematics, 6, 8(3), 217-229, 2002. [11] P.
Erdos, “On sets of distances of ‘n’ points in Euclidean space,” Publ. Math. Inst. Hung. Acad. Sci, 5 (1960), 165-169. [12] A. Sebo, E. Tannier, “On metric generators
of Graphs, Mathematics of Operation Research , 29(2) (2004) 383-393. [13] J. Peters-Fransen and O. R. Oellermann. The metric dimension of Cartesian products of
Graphs. Util. Math., 69, pp 33-41, 2006. [14] Z. Mustafa, H. Obiedat and F. Awawdeh, Some fixed point theorem for mapping on complete G- metric spaces, Fixed
Point Theory and Applications, Volume 2008, Article ID 189870, doi:10.1155/2008/189870. [15] B.C.Dhage, ”Generalised metric spaces and mappings with fixed
point,” Bulletin of the Calcutta Mathematical Society, vol.84, no. 4, pp. 329-336, 1992. [16] B.C.Dhage, ”Generalised metric spaces and topological structure- I,”
Analele Stiintifice ale Universitˇatii ”Al.I.Cuza” din Iasi. Serie Nouˇa. Matematicˇa, vol.46, no. 1, pp. 3-24, 2000. [17] S.G¨ahler, ”2-metrische R¨aume und ihre
topologische Struktur,” Mathe- matische Nachrichten, vol.26, pp. 115-148, 1963. [18] S.G¨ahler, ”Zur geometric 2-metrische r¨aume,” Revue Roumaine de Math
´ematiques Pures et Appliqu´ees, vol.40, pp. 664-669, 1966. [19] R.Diestel (Ed). Directions in Infinite Graphs and Combinatorics. Topics in Discrete Mathematics
3. Elsevier-North Holland, 1992. [20] D. Konig. Theory of Finite and Infinite Graphs. Birkhauser, Boston,1990. [21] C.St.J.A. Nash-Williams. Infinite Graphs. A
survey. Journal of Combinatorial Theory, 3:286-301, 1967. [22] C. Thomassen. Infinite Graphs. Further Selected Topics in Graph Theory, 129-160. Academic Press,
London, 1983. [23] Manjusha. R, Dr. Sunny Kuriakose A ‘On metric dimension of some special graphs and its isomorphism’, University Grant Commission of
India sponsored National conference on Fuzzy Logic and its Applications to Computer Science,2014.

About
https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 33/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
Support
Terms
Privacy
Copyright
Cookie Preferences
Do not sell or share my personal information

English
Current Language: English
Español
Português
Français
Deutsch

© 2023 SlideShare from Scribd

Share Clipboard

Facebook
Twitter
LinkedIn

Link

Public clipboards featuring this slide

No public clipboards found for this slide

Select another clipboard

Looks like you’ve clipped this slide to already.

Search for a clipboard

Create a clipboard

You just clipped your first slide!

Clipping is a handy way to collect important slides you want to go back to later. Now customize the name of a clipboard to store your clips.

Create a clipboard

Name* Best of Slides

Description Add a brief description so oth
Visibility
Others can see my Clipboard
Cancel Save
Hate ads?

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 34/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Get SlideShare without ads

Enjoy access to millions of presentations, documents, ebooks, audiobooks, magazines, and more ad-free.
Try free for 30 days

Special Offer to SlideShare Readers

×

Just for you: FREE 60-day trial to the world’s largest digital library.
The SlideShare family just got bigger. Enjoy access to millions of ebooks, audiobooks, magazines, and more from Scribd.

Read free for 60 days

Cancel anytime.

Report as inappropriate
×

Select your reason for reporting this presentation as inappropriate.

There was an error while reporting this slideshow. Please try again.

None Flag

0 likes
×
Be the first to like this

Views
×
Total views
750
On SlideShare
0
From Embeds
0
Number of Embeds
2

You have now unlocked unlimited access to 20M+ documents!

×

Unlimited Reading

Learn faster and smarter from top experts

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 35/36
1/25/23, 11:51 AM AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHS

Unlimited Downloading

Download to take your learnings offline and on the go

You also get free access to Scribd!

Instant access to millions of ebooks, audiobooks, magazines, podcasts and more.

Read and listen offline with any device.

Free access to premium services like Tuneln, Mubi and more.

Discover More On Scribd

Help us keep SlideShare free

It appears that you have an ad-blocker running. By whitelisting SlideShare on your ad-blocker, you are supporting our community of content creators.

Whitelist SlideShare Continue without Whitelisting

Hate ads? Get SlideShare without ads
×

We've updated our privacy policy.

We’ve updated our privacy policy so that we are compliant with changing global privacy regulations and to provide you with insight into the limited ways in which we
use your data.

You can read the details below. By accepting, you agree to the updated privacy policy.

Thank you!

Accept and continue View updated privacy policy

We've encountered a problem, please try again.

https://www.slideshare.net/Fransiskeran/an-application-of-gd-metric-spaces-and-metric-dimension-of-graphs?from_action=save 36/36