关于图P_(a,b)的邻点可区别染色On the Adjacent Vertex Distinguishing Coloring of Graph P_(a,b)
严谦泰;
摘要(Abstract)：
给出了图P_(a, b)的邻点可区别边染色数、邻点可区别全染色数、邻点强可区别全染色数。
关键词(KeyWords)： 邻点可区别边染色;邻点可区别全染色;邻点强可区别全染色;图P_(a, b)
基金项目(Foundation):
作者(Authors): 严谦泰;
DOI: 10.16140/j.cnki.1671-5330.2022.05.025
参考文献(References)：
- [1]BURRIS A C,SCHELP R H.Vertex-distinguishing proper edge-coloring of graph[J].Graph Theory,1997,26:73-82.
- [2]BALISTER P N,GYORI E,LEHEL J,et al.Adjacent vertex distinguishing edge-coloring[J].Graph Theory,2003,42:95-109.
- [3]HATAMI H.Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number[J].Journal of Combinatorial Theory(Series B),2005,95:246-256.
- [4]ZHANG Z F,LIU L Z,WANG J F.Adjacent strong edge coloring of graphs[J].Appl.Math.Letter,2002,15:623-626.
- [5]LI J W,ZHANG Z F,CHEN X E,et al.D(β)-vertex-distinguishing proper edge-coloring of graphs[J].Acta.Math.Sinica,2006(15):703-708.
- [6]ZHANG Z F,QIU P X,XU B G,et al.Vertex-distinguishing total coloring of graphs[J].Ars.comb.,2008,87:33-45.
- [7]ZHANG Z F,CHEN X E,LI J W,et al.On adjacent-vertex-distinguishing total coloring of graphs[J].Science in China(Series A),2005,48(3):289-299.
- [8]ZHANG Z F,CHEN H,YAO B,et al.On the adjacent vertex strong distinguishing total coloring of graphs[J].Science in China(Series A),2008,51(3):427-436.
- [9]KATHIRESAN K M.Two classes of graceful graphs[J].Ara Combinatorial,2000,55:129-132.
- [10]BONDY J A,MURTY U S R.Graph theory with application[M].New York:The Macmillan Press Ltd.,1976.