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 Iyer, Akshay Vishnuprakash; Kureethara, Joseph Varghese Title A name given to the resource Forbidden subgraphs and prohibited colorings for vertex identification in graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550092; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500922" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500922</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105007645398?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007645398?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 Iyer A.V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India; Kureethara J.V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India Description An account of the resource A red-white coloring of a graph G of diameter d is done by assigning the colors red and white to the vertices of the graph such that, there should be at least one red vertex. Then, each of the vertices is assigned a vector of length d called code in which the value of ith coordinate is equal to the number of red-colored vertices at distance i from this vertex, i ? {1, 2, 3,,d}. A red-white coloring when the code assigned to each vertex is different than that coloring is called an ID-coloring and a graph which has an ID-coloring is an ID-graph. The minimum number of vertices required to be colored red to get an ID-coloring is called the ID-number. ID-coloring is not possible for all graphs. There exist many properties which prevent ID-coloring. In this paper, we explore some forbidden induced subgraphs and certain prohibited red-white colorings which prevent the existence of ID-coloring. 2025 World Scientific Publishing Company. Subject The topic of the resource distance; Graph coloring; ID-coloring; ID-graph 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