|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
完全图和星的合成的点可区别正常边染色
, PP. 136-143
Keywords: 合成,完全图,星,点可区别正常边染色,点可区别正常边色数
Abstract:
首先,给出了完全图~$K_{p}$~和星~$S_{q}$~的合成的点可区别正常边色数的一个上界:~当~$p\geq2$,~$q\geq4$~时,上界是~$pq+1$.再利用正多边形的对称性以及组合分析的方法来构造染色,分别得到了当$~p=2,~q\geq4$;$p\geq3,~q=4$;~$p$~是偶数且~$p\geq4,~q=5$;$pq$~是奇数且~$p\geq3,~q\geq5$时,~完全图~$K_{p}$~和星~$S_{q}$~的合成的点可区别正常边色数.
| [1] | {1} BURRIS A C. Vertex-distinguishing edge-colorings[D]. Memphis:
|
| [2] | Memphis State University, 1993.
|
| [3] | {2} BALISTER P N, RIORDAN O M, SCHELP R H. Vertex-distinguishing edge
|
| [4] | colorings of graphs[J]. J Graph Theory, 2003, 42(2): 95-109.
|
| [5] | {3} BAZGAN C, HARKAT-BENHAMDINE A, LI H, et al. On the
|
| [6] | vertex-distinguishing proper edge colorings of graphs[J]. J Combin
|
| [7] | Theory, 1999, 75(2): 288-301.
|
| [8] | {4} BURRIS A C, SCHELP R H. Vertex-distinguishing proper
|
| [9] | edge-colorings[J]. J Graph Theory, 1997, 26(2): 73-82.
|
| [10] | {5} CHEN X N, GAO Y P. Vertex-distinguishing proper edge-coloring
|
| [11] | chromatic numbers of the composition of two graphs[J]. Journal of
|
| [12] | Jilin University: Science Edition, 2011, 49(2): 207-212.
|
| [13] | {6} HOR\v{N}\''{A}K M, SOT\''{A}K R. Observability of complete
|
| [14] | multipartite graphs with equipotent parts[J]. Ars Combinatoria,
|
| [15] | 95, 41: 289-301.
|
| [16] | {7} \v{C}ERN\''{Y} J, HOR\v{N}\''{A}K M, SOT\''{A}K R. Observability of a
|
| [17] | graph[J]. Math Slovaca, 1996, 46(1): 21-31.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
