• EDGE COLOURING OF GENERALIZED PETERSEN GRAPH OF TYPE k

B. STEPHEN JOHN, J. C. JESSY*

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.


Keywords


Cycle, Chromatic number, Edge colouring, Generalized petersen graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2018 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter