A study on restrained geodetic domination in graphs

dc.contributor.guideShathish, Sangeetha
dc.coverage.spatial
dc.creator.researcherJoy, John
dc.date.accessioned2023-06-16T10:06:17Z
dc.date.available2023-06-16T10:06:17Z
dc.date.awarded2023
dc.date.completed2023
dc.date.registered2019
dc.description.abstractIn a graph G = (V, E), the shortest path between any two vertices u and v in G is u and#8722; v geodesic. This distance concept leads to the introduction of geodetic set and geodetic number which has wide applications in location theory and convexity theory. A vertex subset S of a graph G is said to be a geodetic set, if all vertex in G is in u and#8722; v geodesic for some pair of vertices u and v in S. The minimum cardinality of such a set is the geodetic number and is denoted as g(G). A vertex subset M of a graph G is said to be a dominating set of G if for all vertex v and#8712; V (G), either v and#8712; M or v is adjacent to a vertex in M. The minimum cardinality of such a set is the domination number and is denoted by and#947;(G). In general, the geodetic set and newlinethe dominating set of a graph need not be the same. This led to the study of the geodetic dominating set. If a geodetic set S is a dominating set of a graph G, then S is called a geodetic dominating set. The minimum cardinality of such a set is the geodetic domination number, which is represented by and#947;g(G). There are several studies done on the geodetic and domination concepts so far. In the present study, we have explored the concept of restrained geodetic domination and its structural properties in graphs particularly in product graphs and derived graphs. A vertex subset S of a graph G = (V, E) is called a restrained geodetic dominating set if S is a geodetic dominating set of G and lt V and#8722; S gt has no isolated vertex. The minimum cardinality of such a set is called restrained geodetic domination number, which is denoted by and#947;gr(G). We have studied this concept for diand#64256;erent classes of graphs and concerning the graph operations such as Cartesian product, corona product, and join of graphs. Further, the study is extended to restrained geodetic domination in derived graphs such as edge subdivision graph, line graph and power of a graph. Also, investigated the properties of graphs with the restrained geodetic domination number equal to the order of the graph.
dc.description.note
dc.format.accompanyingmaterialCD
dc.format.dimensionsA4
dc.format.extentxvii, 136p.;
dc.identifier.urihttp://hdl.handle.net/10603/492346
dc.languageEnglish
dc.publisher.institutionDepartment of Mathematics and Statistics
dc.publisher.placeBangalore
dc.publisher.universityCHRIST University
dc.relation92
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordDomination,
dc.subject.keywordGeodetic Domination Number,
dc.subject.keywordGeodetic Number,
dc.subject.keywordMathematics
dc.subject.keywordMathematics Applied
dc.subject.keywordPhysical Sciences
dc.subject.keywordRestrained Domination,
dc.subject.keywordRestrained Geodetic Domination Number.
dc.titleA study on restrained geodetic domination in graphs
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 11
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
171.02 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
968.78 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_abstract.pdf
Size:
137.02 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_contents.pdf
Size:
110.87 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter1.pdf
Size:
426.31 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: