| 图有哈密顿(g,f)-因子的度条件 |
| |
| 引用本文： | 王超.图有哈密顿(g,f)-因子的度条件[J].山东大学学报(理学版),2009,44(10):21-25. |
| |
| 作者姓名： | 王超 |
| |
| 作者单位： | 1. 山东大学威海分校数学与统计学院，山东 威海 264200；2. 山东大学数学学院, 山东 济南 250100 |
| |
| 基金项目： | 国家自然科学基金资助项目(10871119);高等学校博士学科点专项基金资助课题(200804220001) |
| |
| 摘 要： | 设G是一个n阶2连通图,整数a,b满足2≤a＜b,g(x)和f(x)是定义在V(G)上的两个非负整数值函数,使得x∈V(G),满足a≤g(x)2-(a-1)(b-a)]/(a-1),n＞(a+b-3)(a+b-2)]/(a-1), 且max｛dG(x) ,dG(y) ｝≥(b-1)n/(a+b-2)对G中任意两个不相邻的顶点x,y都成立。
|
| 关 键 词： | 图 (g f)-因子 哈密顿(g f)-因子 |
| 收稿时间： | 2009-04-20 |
A degree condition for graphs to have Hamiltonian (g,f)-factors |
| |
| WANG Chao.A degree condition for graphs to have Hamiltonian (g,f)-factors[J].Journal of Shandong University,2009,44(10):21-25. |
| |
| Authors: | WANG Chao |
| |
| Institution: | 1. School of Mathematics and Statistics, Shandong University at Weihai, Weihai264200, Shandong, China;2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China |
| |
| Abstract: | Let G be a 2 connected graph of order n, and let a and b be integers such that 2≤a＜b, and let g(x) and f(x) be two nonnegative integer valued functions defined on V(G) such that a≤g(x)＜f(x)≤b for each x∈V(G). It is proved that G has a Hamiltonian (g,f) factor if the minimum degree of G satisfies the following conditions,δ(G)≥(b-1)2-(a-1)(b-a)]/(a-1)〖SX)〗,n＞(a+b-3)(a+b-2)]/(a-1), and max｛dG(x) ,dG(y) ｝≥(b-1)n/(a+b-2) for any two nonadjacent vertices x and y in G. |
| |
| Keywords: | graph (g f)-factor Hamiltonian (g f)-factor |
|
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
