Search or add a thesis

Advanced Search (Beta)
Home > On the Metric Dimension and Minimal Doubly Resolving Sets of Families of Graphs

On the Metric Dimension and Minimal Doubly Resolving Sets of Families of Graphs

Thesis Info

Access Option

External Link

Author

Sultan, Saba

Program

PhD

Institute

Government College University

City

Lahore

Province

Punjab

Country

Pakistan

Thesis Completing Year

2018

Thesis Completion Status

Completed

Subject

Mathemaics

Language

English

Link

http://prr.hec.gov.pk/jspui/bitstream/123456789/12931/1/Saba_Sultan_Maths_HSR_2018_GCU_lahore_03.08.2018.pdf

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676726806985

Similar


Let G = (V (G);E(G)) be a connected graph. The distance between two vertices u; v 2 V (G) is the length of shortest path between them and is denoted by d(u; v). A vertex x is said to resolve a pair of vertices u; v 2 V (G) if d(u; x) 6= d(v; x). For an ordered subset, B = fb1; b2; : : : ; bng of vertices of G, the n-tuple r(vjB) = (d(v; b1); d(v; b2); : : : ; d(v; bn)) is called representation of vertex v with respect to B or vector of metric coordinates of v with respect to B. The set B is called a resolving set of G if r(ujB) 6= r(vjB) for every pair of vertices u; v 2 V (G), i.e., the representation of each vertex with respect to B is unique. The resolving set with minimum cardinality is called metric basis of G. This minimum cardinality is called metric dimension and is denoted by _(G). Notice that the i-th coordinate in r(vjB) is 0 if and only if v = bi. Thus in order to show that B is a resolving set of G, it su_ces to verify that r(ujB) 6= r(vjB) for every pair of distinct vertices u; v 2 V (G) n B. Let G be a graph of order at least 2. Two vertices x; y 2 V (G) are said to doubly resolve the vertices u; v of G if d(u; x) ? d(u; y) 6= d(v; x) ? d(v; y): A subset D _ V (G) is called a doubly resolving set of G if every two distinct vertices of G are doubly resolved by some two vertices in D, i.e., all coordinates of the vector r(ujD)?r(vjD) can not be same for every pair of distinct vertices u; v 2 V (G). The minimal doubly resolving set problem is to _nd a doubly resolving set of G with the minimum cardinality. The cardinality of minimal doubly resolving set of G is denoted by(G). We have _(G) _(G) always. Therefore these sets can contribute in finding upper bounds on the metric dimension of graphs. In this thesis, we have investigated the minimal doubly resolving set problem for necklace graph, circulant graph, antiprism graph and M obius ladders. Also, in last part of thesis, the metric dimension problem has been investigated for kayak paddle graph and cycles with chord.
Loading...

Similar Thesis

Showing 1 to 20 of 100 entries
TitleAuthorSupervisorDegreeInstitute
PhD
Government College University, Lahore, Pakistan
Mphil
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
Mphil
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
National University of Computer and Emerging Sciences, Islamabad, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
PhD
National University of Computer and Emerging Sciences, Islamabad, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
RMT
COMSATS University Islamabad, Islamabad, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
PhD
Lahore College for Women University, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
TitleAuthorSupervisorDegreeInstitute
Showing 1 to 20 of 100 entries

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...