Average distance colouring of graphs

[1] F. Harary, Graph Theory, Addison Wesley, Reading, Massachusetts, 1969. ⇒205 Search in Google Scholar

[2] W. Goddard and O. R. Oellermann, Structural Analysis of Complex Networks: 49-72, 2011. ⇒206, 208 Search in Google Scholar

[3] H. Wiener, Structural determination of para n boiling points, J. Am. Chem. Soc. (1947), 69, 1, 17–20. ⇒205 Search in Google Scholar

[4] F. Kramer and H. Kramer, A survey on the distance-colouring of graphs, Discrete Mathematics, vol. 308, no. 2, pp. 422–426, 2008. ⇒206 Search in Google Scholar

[5] P. K. Niranjan and S. R. Kola, The k-distance chromatic number of trees and cycles, AKCE International Journal of Graphs and Combinatorics, vol. 16(2), 2019 ⇒206 Search in Google Scholar

[6] L. March and P. Steadman, The Geometry of Environment: An introduction to spatial organization in design, M.I.T. Press, Cambridge, Mass., 1974. ⇒205 Search in Google Scholar