On coloring problems with respect to domination in graphs

dc.contributor.guideJoseph, Mayamma
dc.coverage.spatial
dc.creator.researcherChithra, K P
dc.date.accessioned2025-05-28T04:43:24Z
dc.date.available2025-05-28T04:43:24Z
dc.date.awarded2025
dc.date.completed2025
dc.date.registered2018
dc.description.abstractThis thesis deals with proper coloring of graphs subject to certain constraints based on the concepts of domination. Extending the concepts of dominator coloring and global dominator coloring, the present study introduces and study three domination related colorings are namely: total global dominator coloring, total domination coloring and anti-dom-coloring. A total global dominator coloring (tgd-coloring) of a graph G is a coloring in which every vertex of G has a proper dom-color class and an antidom-color class. The proper dom-color class of a vertex v is a color class in which every vertex in it is adjacent to v while the anti-dom-color class of v is a color class in which none of the vertices in it is dominated by v. Total global dominator chromatic number of a graph G, denoted by and#967;tgd(G), is the minimum number of colors required for a tgd-coloring of G. A detailed study of the parameter and#967;tgd(G) has been carried out and the results include newlinebounds of and#967;tgd(G) and its relation with the other graph parameters of G such as o(G), and#967;(G), and#947;(G), and#967;t d(G), and#947;g(G), and#967;gd(G) etc. The total global dominator chromatic number of several graph classes such as paths, cycles, complete bipartite graphs, trees, and unicyclic graphs have been determined. The study also deal with the tgd-coloring of Mycielskian graphs, derived graphs such as helm graphs, web graphs, sun graphs, closed suns graph etc. and values of and#967;tgd(G) when G newlineis graph obtained by some graph operations such as union of graphs, corona of graphs and join of graphs. A total domination coloring of a graph G is a coloring in which every vertex has a proper dom-color class and each of the color classes is dominated by some newlinevertex of G. The minimum number of colors required for the total domination coloring of G is said to be the total domination chromatic number of G, denoted by and#967;td(G). The relation of and#967;td(G) with and#967;(G), and#947;(G), and#947;t(G), and#967;t d(G) etc. are determined.
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensionsA4
dc.format.extentxvi, 160p.;
dc.identifier.researcherid0000-0003-3871-1345
dc.identifier.urihttp://hdl.handle.net/10603/641716
dc.languageEnglish
dc.publisher.institutionDepartment of Mathematics and Statistics
dc.publisher.placeBangalore
dc.publisher.universityCHRIST University
dc.relation77
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordAnti-Dom-Coloring,
dc.subject.keywordColoring,
dc.subject.keywordDomination Coloring,
dc.subject.keywordGlobal Dominator Coloring,
dc.subject.keywordMathematics
dc.subject.keywordPhysical Sciences
dc.subject.keywordTotal Domination Coloring,
dc.subject.keywordTotal Dominator Coloring,
dc.subject.keywordTotal Global Dominator Coloring,
dc.titleOn coloring problems with respect to domination in graphs
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 13
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
166.92 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
869.62 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_abstract.pdf
Size:
158.91 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_contents.pdf
Size:
119.82 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter1.pdf
Size:
401.54 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: