J4 ›› 2008, Vol. 43 ›› Issue (12): 48-51.

• Articles • Previous Articles     Next Articles

Incidence chromatic number of several generalized Petersen graphs

 LIU Da-Kun, Wang Shu-Dong   

  • Received:2008-09-05 Online:2008-12-16 Published:2009-11-09

PDF (PC)

1317

Abstract:

When n≡0(mod 4),if k be odd, k=2,and k=4,the incidence chromatic number of generalized Peterson graph P(n,k) was obtained.

Key words: null

CLC Number: 

  • null
[1] SONG Hong-jie, GONG Xiang-nan, PAN Wen-hua, XU Chang-qing. Neighbor sum distinguishing total coloring of Halin graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 65-67.
[2] FEI Shi-long, BAI Yao-qian. A class of random walks in a random environment with singular jumps [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(11): 119-126.
[3] YAO Jing-jing, XU Chang-qing. Neighbor sum distinguishing total coloring of graphs with maximum degree 3 or 4 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(02): 9-13.
[4] YANG Chen, MA Hai-cheng. Positive and negative inertia indexes and nullity of two special kinds of tricyclic graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(02): 32-37.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd