首页 | 本学科首页   官方微博 | 高级检索  
     

(g,f) -因子和可扩图
引用本文:李建湘,闫晓霞. (g,f) -因子和可扩图[J]. 数学物理学报(A辑), 2006, 26(3): 321-328
作者姓名:李建湘  闫晓霞
作者单位:湖南科技大学数学院,北京理工大学应用数学系 湘潭 411201,北京 100081
基金项目:湖南科技厅科技攻关基金(04Fj4105)资助
摘    要:设G是一个图,并设g和f是定义在V(G)上的整值函数使得对所有的点x∈ V(G)均有g(x)≤ f(x).称一个图G是(g,f,H) -可扩的,如果在删除了任意一个同构于H的子图中所有点后,剩下G的子图有一个(g,f) -因子.该文给出了(g,f,H) -可扩图的特征.进一步,研究了(g,f,H) -可扩(H=nK1)的性质.

关 键 词:(g,f) -因子  (g,f,H) -可扩图
文章编号:1003-3998(2006)03-321-08
收稿时间:2003-05-08
修稿时间:2004-08-10

(g,f)-factors and Extendable Graphs
Li Jianxiang,Yan Xiaoxia. (g,f)-factors and Extendable Graphs[J]. Acta Mathematica Scientia, 2006, 26(3): 321-328
Authors:Li Jianxiang  Yan Xiaoxia
Affiliation:1 College of Mathematics, Hunan University of Science and Technology, Xiangtan 411201; 2Department of Applied Mathematics, Beijing Institue of Technology, Beijing 100081
Abstract:Let G be a graph, and let g and f be integer-valued functions defined on V(G) such that g(x)≤ f(x) for all x∈ V(G). A graph G is called a (g,f,H)-extendable ifafter deleting the vertices of any subgraph which is isomorphic to H the remaining subgraph of G has a (g,f)-factor. In thepaper the characterization of (g,f,H)-extendable graph is given. Furthermore, the properties of (g,f,n)-extendable graph(H=nK1) are studied.
Keywords:(g  f)-factor  (g  f   H)-extendable graph
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《数学物理学报(A辑)》浏览原始摘要信息
点击此处可从《数学物理学报(A辑)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号