• EDGE COLOURING OF GENERALIZED PETERSEN GRAPH OF TYPE k

Abstract

Let  be a connected simple graph. An edge colouring of a graph G is a function  where C is a set of distinct colours. The edge colouring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper we determine the edge colouring of generalized petersen graph of type k.