Search
 
loader loading subjects...
cover
Some Results of Incidence Coloring on Generalized Petersen Graphs
Kun-Fu Ding, Kung-Jui Pai, Jou-Ming Chang, Rueiher Tsaur
85 - 91
10.3233/978-1-61499-484-8-85
Frontiers in Artificial Intelligence and Applications
Volume 274: Intelligent Systems and Applications
Abstract

Let χi(G) denote the incidence coloring number of a graph G. In this paper, we study the incidence coloring on generalized Petersen graphs GP(n,k). We first assure that 4≤χi(GP(n,k))≤5. Furthermore, we provide the following results: (i) χi(GP(n,k))=5 if n is odd, (ii) χi(GP(n,2))=5, and (iii) χi(GP(n,k))=4 if n≡0(mod 4) and k is odd.

$35.00 / €27.50 / £22.00
Add PDF to cart