Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have