English

运筹学学报 ›› 2012, Vol. 16 ›› Issue (3): 132-138.

• 运筹学 • 上一篇    下一篇

(0, mf-k+1)-图中具有正交(0,f)-因子分解的子图

肖岚1, 刘岩2   

  1. 1. 南昌大学理学院 2. 华南师范大学数学科学学院
  • 收稿日期:2012-04-16 修回日期:2012-06-07 出版日期:2012-09-15 发布日期:2012-09-18
  • 通讯作者: 肖岚 E-mail:xiaolan@amss.ac.cn

Subgraph with orthogonal (0,f)-factorization in (0, mf-k+1)-graph

XIAO Lan1, LIU Yan2   

  1. 1. School of Science,  Nanchang University 2. School of Mathematical Sciences, South China Normal University
  • Received:2012-04-16 Revised:2012-06-07 Online:2012-09-15 Published:2012-09-18
  • Contact: XIAO Lan E-mail:xiaolan@amss.ac.cn
  • Supported by:

    National Natural Science Foundation of China (No. 10201019)

PDF

1053

被引次数

2

摘要： 设G是一个简单图, f是定义在V(G)上的整数值函数，且m是大于等于2的整数. 讨论(0, mf-k+1)-图G的正交因子分解, 并且证明了对任意的1≤k≤m, (0, mf-k+1)-图G中存在着一个子图R, 使得R有一个(0,f)-因子分解正交于图G中的任意一个k-子图H.

关键词: 图, 因子, 正交因子分解

Abstract: Let G be a simple graph, f be a non-negative integer-valued function defined on V(G),  m≥2 and be an integer. In this paper, we investigate the orthogonal factorization of (0,mf-k+1)-graph and prove that, for any integer 1≤ k≤m, every (0,mf-k+1)-graph G has a subgraph R such that, R has a (0,f)-factorization orthogonal to any k subgraph H of G.

Key words: graph, factor, orthogonal factorization

中图分类号: