Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Antony, Toby B.; Naduvath, Sudev Title A name given to the resource Further studies on chromatic completion of graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;2;Article No.;2550032; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500326" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500326</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105008671341?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105008671341?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Antony T.B., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India Description An account of the resource The chromatic completion graph of G with respect to a proper vertex coloring c of G, denoted by Gc?, is the graph obtained by adding all possible edges to G without violating the proper coloring protocol. The maximum number of edges added to G to obtain the chromatic completion graph is the chromatic completion number ??(G). Equitable chromatic completion graph Ge? of a graph G and equitable chromatic completion number ??e(G) are the equitable analogues of Gc? and ??(G), respectively. In this paper, we present various structural aspects of chromatic completion graphs and equitable chromatic completion graphs. Also, the chromatic completion and the related parameter are described in terms of adjacency matrix and color matrix of graphs. The equitable chromatic completion graph is shown to be a Tur graph. More relevantly, we obtained the equitable chromatic completion number of an arbitrary graph G. World Scientific Publishing Company. Subject The topic of the resource chromatic completion graph; chromatic completion number; equitable chromatic completion graph; equitable chromatic completion number; Proper edge Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online