期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

A Note on Z_3 -Connected Graphs with Degree Sum Condition

A Note on Z_3 -Connected Graphs with Degree Sum Condition
原文传递
导出
摘要 A graph G satisfies the Ore-condition if d（x）＋d（y） ≥ ｜V（G）｜ for any xy E（G）. Luo et al. [European J. Combin., 2008] characterized the simple Z3-connected graphs satisfying the Ore-condition. In this paper, we characterize the simple Z3-connected graphs G satisfying d（x）＋d（y） ≥ ｜V（G）｜ - 1 for any xy E（G）, which improves the results of Luo et al. A graph G satisfies the Ore-condition if d（x）＋d（y） ≥ ｜V（G）｜ for any xy E（G）. Luo et al. [European J. Combin., 2008] characterized the simple Z3-connected graphs satisfying the Ore-condition. In this paper, we characterize the simple Z3-connected graphs G satisfying d（x）＋d（y） ≥ ｜V（G）｜ - 1 for any xy E（G）, which improves the results of Luo et al.
作者 Xin Min HOU
机构地区 Department of Mathematics
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2012年第11期2161-2168,共8页 数学学报（英文版）
基金 Supported by National Natural Science Foundation of China (Grant No. 11071233) the Fundamental Research Funds for the Central Universities (Grant No. WK0010000021)
关键词 Group connectivity degree sum condition Group connectivity, degree sum condition
分类号 O157.5 [理学—基础数学] P283.1 [天文地球—地图制图学与地理信息工程]
  • 相关文献

参考文献1

二级参考文献75

  • 1Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications, Elsevier, New York, 1976.
  • 2Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., et al.: Combinatroial Optimization~ John Wiley and Sons, New York, 1998.
  • 3Jaeger, F., Linial, N., Payan, C., et al.: Group connectivity of graphs -- a nonhomogeneous analogue of nowhere-zero flow properties. J. Combin. Theory Set. B, 56, 165-182 (1992).
  • 4Tutte, W. T.: A contribution to the theory of chromatic polynomials. Canad. J. Math., 6, 80-91 (1954).
  • 5Jaeger, F.: Nowhere-zero flow problems. In: Selected Topics in Graph Theory (L. Beineke and R. Wilson, eds.), Vol. 3, Academic Press, London/New York, 1988, 91-95.
  • 6Tutte, W. T.: On the algebraic theory of graph colourings. J. Combin. Theory, 1, 15-50 (1966).
  • 7Lai, H.-J.: Reduction towards collapsibility. In: Graph Theory, Combinatorics, and Applications (eds. Y. Alavi and A. Schwenk), John Wiley and Sons, Inc., New York, 1995, 661-670.
  • 8Alon, N., Linial, N., Meshulam, R.: Additive bases of vextor spaces over prime fields. J. Combin. Theory Set. A, 57, 203-210 (1991).
  • 9Kochol, M.: An equivalent version of the 3-flow conjecture. J. Combin. Theory Ser. B, 83, 258-261 (2001).
  • 10Lal, H.-J.: Group connectivity of 3-edge-connected chordal graphs. Graphs and Combinatorics, 16, 165-176 (2000).

共引文献3

Acta Mathematica Sinica,English Series
2012年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部