韩金仓,吕新忠,张忠辅.关于完美全图的Hamilton-性[J].数学研究及应用,1996,16(1):41~46 |
关于完美全图的Hamilton-性 |
On the Hamiltonity of Perfect Total Graphs |
投稿时间:1994-04-07 |
DOI:10.3770/j.issn:1000-341X.1996.01.008 |
中文关键词: |
英文关键词:perfect total grahp Hamiltonity. |
基金项目: |
|
摘要点击次数: 2221 |
全文下载次数: 1043 |
中文摘要: |
设G(V,E)是一个简单图,而V(T(G))=V(G)∪E(G),B(T(G))={yz|y,z相邻或相关,y,z∈V(G)∪E(G)}.则称T(G)为G(V,E)的全图;若对G的每一导出子图H,有x(H)=ω(H);则称G是完美的.其中x(H),ω(H)分别表示H的色数和团数.本文给出了完美全图是Hamilton图的充分必要条件. |
英文摘要: |
Let G(V,E) be a simple graph. and V(T(G))=V(G)∪E(G0. E(T(G)) = {yz|y is adjacent or incident of incident to z,yz∈V(G)∪E(G)}. Let X(H) and ω(H) be chromatic number and the munber of cliques of H. respectively. Then T(G) is called a total graph of G. G is called perfect if X(H)=ω(H) for each induced subgraph H of G. We give a necessary and suffciend condition for a perfect total graph to hamiltonian. |
查看全文 查看/发表评论 下载PDF阅读器 |