Christ University Institutional Repository

A STUDY ON CERTAIN CHROMATIC PARAMETERS AND POLYNOMIALS OF GRAPHS

SMITHA ROSE , C. G. (2018) A STUDY ON CERTAIN CHROMATIC PARAMETERS AND POLYNOMIALS OF GRAPHS. PhD thesis, CHRIST(Deemed to be University).

[img]
Preview
PDF (Title) - Published Version
431Kb
[img]
Preview
PDF (Certificate) - Published Version
1395Kb
[img]
Preview
PDF (Abstract) - Published Version
61Kb
[img]
Preview
PDF (Declaration) - Published Version
292Kb
[img]
Preview
PDF (Acknowledgement) - Published Version
63Kb
[img]
Preview
PDF (Contents) - Published Version
58Kb
[img]
Preview
PDF (List of tables) - Published Version
135Kb
[img]
Preview
PDF (List of figures) - Published Version
143Kb
[img]PDF (Chapter 1) - Published Version
Restricted to Registered users only

280Kb
[img]PDF (Chapter 2) - Published Version
Restricted to Registered users only

483Kb
[img]PDF (Chapter 3) - Published Version
Restricted to Registered users only

360Kb
[img]PDF (Chapter 4) - Published Version
Restricted to Registered users only

312Kb
[img]PDF (Chapter 5) - Published Version
Restricted to Registered users only

358Kb
[img]PDF (Chapter 6) - Published Version
Restricted to Registered users only

298Kb
[img]PDF (Chapter 7) - Published Version
Restricted to Registered users only

97Kb
[img]
Preview
PDF (Bibliography) - Published Version
131Kb

Abstract

In graph theory, graph colouring pertains to the assignment of colours to the elements of a graph such as vertices, edges and faces. Because of the theoretical and practical implications of graph colourings in real-life situations, it is an adequate mathematical model for a wide range of applications such as network analysis, genomic, routing, optimisation techniques, digital networks and so forth. Motivated by various problems in chemical graph theory and information networks, chromatic topological indices were introduced in recent literature [81], opening ample and vibrant research area in graph theory. In the research reported in this thesis, the vertices of a graph are assigned with colours subject to certain conditions and manipulating their colour codes, a rich research area on chromatic topological indices and different chromatic polynomials are established. After mentioning some fundamental terminologies, the study handles the notions of chromatic topological indices and chromatic irregularity indices. A detailed discussion of their upper and lower bounds concerning certain colouring conditions is carried out in this thesis. Chromatic topological indices of a wide variety of graph classes such as wheels, double wheels, helm graphs, closed helm graphs, flower graphs, sunflower graphs and blossom graphs are considered and investigated. The chromatic topological indices of certain derived graphs such as Mycielskian of paths and cycles are also included. Equitable chromatic topological and irregularity indices and injective chromatic topological and irregularity indices are defined and their values are determined for a handful of graph classes. As an indirect analogue to chromatic polynomials in the literature, the notion of chromatic Zagreb polynomials and chromatic irregularity polynomials are being introduced and the same is determined and discussed for paths, cycles and certain cycle related graph classes. The study brings forth another new concept called chromatic D-polynomials, manipulating some structural properties like the distances between vertices of a graph. An elaborate discourse of the chromatic D-polynomials of fundamental graph classes and some derived graph classes like Mycielski graphs are also accomplished. Analogous to the chromatic D-polynomials, a novel concept of modified chromatic D-polynomials and certain studies on these types of polynomials are demonstrated.

Item Type:Thesis (PhD)
Subjects:Thesis > Ph.D > Mathematics
Thesis
Thesis > Ph.D
ID Code:7787
Deposited By:Shaiju M C
Deposited On:11 May 2019 12:36
Last Modified:28 May 2019 12:48

Repository Staff Only: item control page