图Γ_(3,n)两种染色的研究  

A Study of Two Colorings of Graph Γ_(3,n)

作　　者：张东翰[1] 王晓[1] 

机构地区：[1]商洛学院数学与计算机应用学院,陕西商洛726000

出　　处：《商洛学院学报》2016年第6期1-3,共3页Journal of Shangluo University

基　　金：陕西省教育厅专项科研计划项目(16JK1243)

摘　　要：通过分析图Γ_(3,n)的结构,利用穷举法和组合分析法讨论了图Γ_(3,n)的邻强边染色和邻点可区别全染色,通过构造具体染色得到了图的邻强边色数和邻点可区别全色数。Through analysis of the structure of graph Γ3,n, the adjacent strong edge coloring and the adjacent vertex distinguishing total coloring of graph Γ3,n are discussed by the exhaustion method and the combination analytic method. The adjacent strong edge chromatic number and the adjacent vertex distinguishing total chromatic number of graph Γ3 ,n are gained by constructing specific coloring.

关 键 词：穷举法 组合分析法 邻强边染色 邻点可区别全染色 

分 类 号：O157.5[理学—数学]