引用本文: |
-
韦新,邓天炎,罗海鹏.几类图的树宽[J].广西科学院学报,2009,25(1):17-18,29. [点击复制]
- WEI Xin,DENG Tian-yan,LUO Hai-peng.The Tree-Width of Some Graphs[J].Journal of Guangxi Academy of Sciences,2009,25(1):17-18,29. [点击复制]
|
|
摘要: |
利用图的树宽分解定理,得到圈Cn的r-冠图Ir(Cn)、方型网图F(m;n)(m=1,2,3)、蛛网图W(m,n)和图Pm⊗Pn的树宽. |
关键词: 图 树宽 分解定理 |
DOI: |
投稿时间:2008-05-12 |
基金项目: |
|
The Tree-Width of Some Graphs |
WEI Xin1, DENG Tian-yan2, LUO Hai-peng3
|
(1.College of Shiyuan, Guangxi Teachers Education University, Nanning, Guangxi, 530023, China;2.Department of mathmatics and Computer Science, Guangxi Teachers Education University, Nanning, Guangxi, 530023, China;3.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China) |
Abstract: |
By using the decomposition theorems of tree-width, the tree-width of the r-corona graph of the cycle Cn, mesh Graph F(m;n)(m=1,2,3),Cobweb-chart W(m,n) and Pm⊗Pn has obtained. |
Key words: graphs tree-width decomposition theorem |