Average distance colouring of graphs

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Acta Universitatis Sapientiae. Informatica 2023-12, Vol.15 (2), p.205-220
Hauptverfasser: Pandey, Priyanka, Joseph, Mayamma
Format: Artikel
Sprache:eng
Schlagworte:
average distance
average distance colouring
graph colouring
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2066-7760
1844-6086
2066-7760
DOI:10.2478/ausi-2023-0014