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 Pandey, Priyanka; Joseph, Mayamma Title A name given to the resource VERTEX COLOURING OF FINITE NETWORKS WITH RESPECT TO AVERAGE DISTANCE 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 International Journal of Applied Mathematics;Volume;38;Issue;2s;pp.682-694 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.12732/ijam.v38i2s.109" target="_blank" rel="noreferrer noopener">https://doi.org/10.12732/ijam.v38i2s.109</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105017179082?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017179082?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 Pandey P., CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India; Joseph M., CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India Description An account of the resource For a finite network, represented as a graph G = (V, E) with average distance (G), the average distance colouring of G is a function c from V to the set of non-negative integers, such that for any v ? V, |c(v) ? c(u)| ? 1 for all u ? V such that d(u, v) ? ??. In this paper, we find the average distance colouring number of some special types of networks and present a greedy algorithm to colour any graph with average distance colouring constraint. 2025, Diogenes Co. Ltd.. All rights reserved. Subject The topic of the resource and Phrases: graph colouring; average distance; average distance colouring Publisher An entity responsible for making the resource available Diogenes Co. Ltd. Relation A related resource ISSN: 13111728; 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 All Open Access; Gold Open Access Format The file format, physical medium, or dimensions of the resource online