| 5-桥图的色性 |
| |
| 引用本文： | 徐敏. 5-桥图的色性[J]. 中央民族大学学报(自然科学版), 2014, 0(1): 12-14,59 |
| |
| 作者姓名： | 徐敏 |
| |
| 作者单位： | 青海交通职业技术学院基础部,青海西宁810003 |
| |
| 摘 要： | 由连接两个顶点的s条内部不交的路组成的图叫s-桥图,记作F（k1,k2,…,ks）.本文给出了5-桥图F（3,a,b,c,d）（d≥c≥b≥a≥3）是色唯一的充分必要条件.
|
| 关 键 词： | 广义多边形树 5-桥图 色等价 色唯一 |
The Chromaticity of 5-bridge Graphs |
| |
| XU Min. The Chromaticity of 5-bridge Graphs[J]. Journal of The Central University for Nationalities(Natural Sciences Edition), 2014, 0(1): 12-14,59 |
| |
| Authors: | XU Min |
| |
| Affiliation: | XU Min ( Foundation Department, Qinghai Communication Technical college, Xining Qinghai 810003, China ) |
| |
| Abstract: | The graph consisting of s paths joining two vertices is called an s-bridge graph, denoted F（kI ,k2,… ,k,）. In this paper, we give a sufficient and necessary condition for 5-bridge graphs F（ 3,a,b,c,d） （ d≥ c≥ b ≥ a ≥ 3） to be chromatically unique. |
| |
| Keywords: | generalized polygon tree 5-bridge graphs chromatically equivalent chromatically unique |
| 本文献已被 维普 等数据库收录！ |
|
