| 三角连通[4,2]-图的完全圈可扩性 |
| |
| 引用本文： | 王磊,王江鲁.三角连通[4,2]-图的完全圈可扩性[J].山东科学,2010,23(6):13-15. |
| |
| 作者姓名： | 王磊 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院，山东 济南 250014 |
| |
| 摘 要： | 如果G的任意s个点的导出子图中至少含有t条边,则称图G为s,t]-图.本文证明了:若G是无孤立点的三角连通4,2]-图,则G或者是完全圈可扩的或者同构于F.其中图F有与图■∨K2同构的导出子图.
|
| 关 键 词： | ［s t］-图 完全圈可扩 三角连通 |
| 收稿时间： | 2010-06-10 |
Fully Cycle Extendability of a Triangularly Connected[4,2]-Graphs |
| |
| WANG Lei,WANG Jiang-lu.Fully Cycle Extendability of a Triangularly Connected[4,2]-Graphs[J].Shandong Science,2010,23(6):13-15. |
| |
| Authors: | WANG Lei WANG Jiang-lu |
| |
| Institution: | School of Mathematics,Shandong Normal University,Jinan 250014,China |
| |
| Abstract: | A graph G is a s,t]-graph,if the included subgraphs of its any s vertices have at least t edges.This paper proves that G is either full-cycle extendable or isomorphic to graph F if G is a triangularly connectedgraph without any isolated vertex.Graph F has an induced subgraph isomorphic to ■∨K2. |
| |
| Keywords: | [s t]-graphs full cycle extendability triangular connection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东科学》浏览原始摘要信息 |
| 点击此处可从《山东科学》下载免费的PDF全文 |
|
