| 若干图的点强全染色(英文) |
| |
| 引用本文： | 刘林忠,谢继国,张忠辅. 若干图的点强全染色(英文)[J]. 经济数学, 1998, 0(3) |
| |
| 作者姓名： | 刘林忠 谢继国 张忠辅 |
| |
| 作者单位： | 兰州铁道学院运输管理工程系!730070(刘林忠)，兰州师专数学系!730070(谢继国)，兰州铁道学院应用数学研究所!730070(张忠辅) |
| |
| 摘 要： | 对图G及正整数k，映射f：满足：（1）任意e1，e3，如果e1，e2是相邻或相关联的，则有；（2）对u，v，w（G）有，则称f为G的一个k-点强全染色，并且K|G的社点强全染色称为G的点强全色数．本文讨论了一些特殊困的点强全色数，并提出了一个猜想：若G为每一分图的阶数不小于6的图，则（G），其中（G）为本文中定义的一新参数．
|
| 关 键 词： | 点强全染色 点强全色数 |
ON THE VERTEX STRONG TOTAL COLORING OF GRAPHS |
| |
| Liu Linzhong. ON THE VERTEX STRONG TOTAL COLORING OF GRAPHS[J]. Mathematics in Economics, 1998, 0(3) |
| |
| Authors: | Liu Linzhong |
| |
| Abstract: | Let G(V,E) be a graph,for a positive integer k,a maping satisfies with: (1)If and e1,e2 is adjacent or incident,then (2) For u,v,wV(G),uw,E(G),uv E(G),have then f is called a k-vertex strong total coloring of G and vertex strong total coloring of Gin called the vertex strong tota1 chromatic number of G. In this paper,we obtained some results about (G)of some special graphs,and raised a conjecture:If G is a graph which the order of each componont is at least 6, then (G), where (G) is a new parameter of G(V,E) defind in this paper. |
| |
| Keywords: | Vertex Strong Total Coloring Vertex Strong Total Chromatics Number |
| 本文献已被 CNKI 等数据库收录！ |
|
