| 关于图的可达划分数 |
| |
| 引用本文： | 孙良.关于图的可达划分数[J].北京理工大学学报,1987(4). |
| |
| 作者姓名： | 孙良 |
| |
| 作者单位： | 北京工业学院应用数学系 |
| |
| 摘 要： | 本文给出了E.J.Cockayne和S.T.Hedetniemi的下列猜想的一个新证明:当图G的团图为2-分图时,G的最小团的阶数不大于G的可达划分数;讨论了图的可达划分数与连通度的关系。
|
| 关 键 词： | 图 可达划分数 团图 2-分图 连通度 |
ON THE DOMATIC NUMBER OF GRAPHS |
| |
| Sun Liang.ON THE DOMATIC NUMBER OF GRAPHS[J].Journal of Beijing Institute of Technology(Natural Science Edition),1987(4). |
| |
| Authors: | Sun Liang |
| |
| Institution: | Department of Applied Mathematics |
| |
| Abstract: | A new method is given to prove the following conjecture posed by E.J, Cockayne and S.T. Hedetniemi. If the clique graph of a graph G is a bipartite graph, then the order of the smallest clique of G is less than or equal to the domatic number of G. And the relation between the domatic number and connectivity of a graph is discussed. |
| |
| Keywords: | graph domatic number clique graph bipartite graph connectivity |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
