Acerca de este artículo
Publicado en línea: 12 dic 2023
Páginas: 205 - 220
Recibido: 24 jul 2023
DOI: https://doi.org/10.2478/ausi-2023-0014
Palabras clave
© 2023 Priyanka Pandey et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
For a graph G with n vertices, average distance µ(G) is the ratio of sum of the lengths of the shortest paths between all pairs of vertices to the number of edges in a complete graph on n vertices. In this paper, we introduce average distance colouring and find the average distance colouring number of certain classes of graphs.