数学物理学报

• 论文 •    下一篇

(g,f) -因子和可扩图

李建湘;闫晓霞   

  1. 湖南科技大学数学院 湘潭 411201
  • 收稿日期:2003-05-08 修回日期:2004-08-10
  • 通讯作者: 李建湘
  • 基金资助:
    湖南科技厅科技攻关基金(04Fj4105)资助

(g,f)-factors and Extendable Graphs

Li Jianxiang ; Yan Xiaoxia   

  1. College of Mathematics, Hunan University of Science and Technology, Xiangtan 411201
  • Received:2003-05-08 Revised:2004-08-10
  • Contact: Li Jianxiang

摘要: G是一个图,并设gf是定义在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) -可扩图

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 the
paper the characterization of (g,f,H)-extendable graph is given. Furthermore, the properties of (g,f,n)-extendable graph(H=nK1) are studied.

Key words: (g,f)-factor, (g,f,H)-extendable graph

中图分类号: 

  • 05C70