VERTEX COLOURING OF FINITE NETWORKS WITH RESPECT TO AVERAGE DISTANCE
- Title
- VERTEX COLOURING OF FINITE NETWORKS WITH RESPECT TO AVERAGE DISTANCE
- Creator
- Pandey, Priyanka; Joseph, Mayamma
- Description
- 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.
- Source
- International Journal of Applied Mathematics;Volume;38;Issue;2s;pp.682-694
- Date
- 01-01-2025
- Publisher
- Diogenes Co. Ltd.
- Subject
- and Phrases: graph colouring; average distance; average distance colouring
- Coverage
- Pandey P., CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India; Joseph M., CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India
- Rights
- All Open Access; Gold Open Access
- Relation
- ISSN: 13111728;
- Format
- online
- Language
- English
- Type
- Article
Collection
Citation
Pandey, Priyanka; Joseph, Mayamma, “VERTEX COLOURING OF FINITE NETWORKS WITH RESPECT TO AVERAGE DISTANCE,” CHRIST (Deemed To Be University) Institutional Repository, accessed June 18, 2026, https://archives.christuniversity.in/items/show/23212.