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 edges in a complete graph on n vertices. In this paper, we introduce average distance colouring and find the average distance colouring number...
| Main Authors: | , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Scientia Publishing House
2023-12-01
|
| 丛编: | Acta Universitatis Sapientiae: Informatica |
| 主题: | |
| 在线阅读: | https://doi.org/10.2478/ausi-2023-0014 |