<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>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.</p>
</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.

Average distance colouring of graphs

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"Average distance colouring of graphs"}

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...

Average distance colouring of graphs

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
graph colouring, average distance, average distance colouring

© 2023 Priyanka Pandey et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Average distance colouring of graphs

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 clavegraph colouring, average distance, average distance colouring

© 2023 Priyanka Pandey et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Palabras clave
graph colouring, average distance, average distance colouring