Home
Add
Get on Google Play
Home
> Edit
Add/Update Thesis
Title*
Author's Name*
Supervisor's Name
Abstract
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.
Subject/Specialization
Language
Program
Faculty/Department's Name
Institute Name
Univeristy Type
Public
Private
Campus (if any)
Institute Affiliation Inforamtion (if any)
City where institute is located
Province
Country
Degree Starting Year
Degree Completion Year
Year of Viva Voce Exam
Thesis Completion Year
Thesis Status
Completed
Incomplete
Number of Pages
Urdu Keywords
English Keywords
Link
Select Category
Religious Studies
Social Sciences & Humanities
Science
Technology
Any other inforamtion you want to share such as Table of Contents, Conclusion.
Your email address*