DOI: 10.2478/ausi-2023-0014 ISSN: 2066-7760
Average distance colouring of graphs
Priyanka Pandey, Mayamma Joseph- General Medicine
Abstract
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.