| 关于不可约的图 |
| |
| 引用本文： | 刘儒英.关于不可约的图[J].青海师范大学学报(自然科学版),1993(4). |
| |
| 作者姓名： | 刘儒英 |
| |
| 作者单位： | 青海师范大学数学系 |
| |
| 摘 要： | 图的色唯一性与补图的各分支的不可约性密切相关。用P_n表示n阶路,把K_3的一个项点与P_n-2的一个一度点重迭后得到的图记为D_n。本文分别得到了D_n和P_n是不可约图的一千充分条件,并且给出了一批不可约的D_n和P_n。
|
| 关 键 词： | 色唯一图 伴随多项式 不可约图 |
ON THE IRREDUCIBLE GRAPHS |
| |
| Liu Ruying,.ON THE IRREDUCIBLE GRAPHS[J].Journal of Qinghai Normal University(Natural Science Edition),1993(4). |
| |
| Authors: | Liu Ruying |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | Chromatic uniqueness of graphs has a close relation with irreducibility of each component of com- plementary graph. Let P_n denote the path of n vertices, let D_n denote the graph obtained by identifying arbitrary vertex of K_3 with vertex of degree 1 of P_(n-2). In this paper, we get a sufficient condition that D_n and P_n are irreducible graph, and discover a lot of irreducible D_n and P_n. |
| |
| Keywords: | Chromatically unique graph Adjoint polynomial Irreducible graph |
| 本文献已被 CNKI 等数据库收录！ |
