关于广义θ-图的邻点可区别染色的简单证明  

A Note on the Adjacent Vertex Distinguishing Coloring of the General θ-Graph

作　　者：王志丹 王治文 

机构地区：[1]宁夏大学数学统计学院,宁夏银川750021

出　　处：《经济数学》2017年第4期62-66,共5页Journal of Quantitative Economics

基　　金：国家自然科学基金资助项目(11261046)

摘　　要：在《经济数学》等杂志上已经用穷染法给出了广义θ-图的邻点可区别全染色和邻点可区别边染色,但方法太过繁琐.本文结合P.N.Balister方法从结构上更为简洁的证明广义θ-图的邻点可区别染色的相关猜想.In the Journal of Quantitative Economics and so on, the general method is used to give the adjacent vertex distinguishing total coloring and the adjacent vertex distinguishing edge coloring of the general O- graph. But the methods are too complicated. In this paper, P. N. Balister method is used to prove the relative conjectures of the adjacent vertex distinguis- hing coloring of the general θ- graph.

关 键 词：图 Θ-图 邻点可区别全染色 邻点可区别边染色 

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