| ［s,t］-图泛圈性的一个充分条件 |
| |
| 引用本文： | 刘晓妍. ［s,t］-图泛圈性的一个充分条件[J]. 山东大学学报(理学版), 2008, 43(12): 28-30 |
| |
| 作者姓名： | 刘晓妍 |
| |
| 作者单位： | 山东科技大学公共课部,山东,济南,250031 |
| |
| 摘 要： | 如果图G中任意s个点的导出子图至少含有t条边,则称图G为［s,t］-图。设G是2-连通［4,2］-图,且|G|≥7,G是泛圈图。
|
| 关 键 词： | ［s,t］-图 k-连通 泛圈图 |
| 收稿时间： | 2008-10-02 |
A sufficient condition of a pancyclicity[s,t]-graph |
| |
| LIU Xiao-yan. A sufficient condition of a pancyclicity[s,t]-graph[J]. Journal of Shandong University, 2008, 43(12): 28-30 |
| |
| Authors: | LIU Xiao-yan |
| |
| Affiliation: | Department of Basic Courses, Shandong University of Science and Technology, Jinan 250031, Shandong, China |
| |
| Abstract: | A graph G is called an [s,t]-graph,if there are at least t edges in every induced subgraph of s vertices.Let G be a 2-connected [4,2]-graph and the order of G be not less than 7,then G is a pancyclicity graph. |
| |
| Keywords: | [s t]-graph k-connected pancyclicity graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《山东大学学报(理学版)》下载全文 |
|
