A degree condition for fractional [a, b]-covered graphs

被引:19
|
作者
Yuan, Yuan [1 ]
Hao, Rong-Xia [1 ]
机构
[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China
基金
中国国家自然科学基金;
关键词
Network; Combinatorial problems; Degree condition; Fractional; a; b]-covered graph; ORTHOGONAL FACTORIZATIONS; EXISTENCE; EVEN; (A;
D O I
10.1016/j.ipl.2018.11.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Let G be a graph of order n with delta(G) >= a + 1, and 3 <= a <= b be integers. In this paper, we first show that if G satisfies max{d(G)(X),d(G)(Y)} >= a(n+1)/a+b for each pair of nonadjacent vertices x, y of G, then G is a fractional [a,b]-covered graph. It is a generalization of the known result with a = b = k which is given by Zhou. Furthermore, we show that this result is best possible in some sense. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:20 / 23
页数:4
相关论文
共 50 条
  • [21] A minimum degree condition of fractional (k, m)-deleted graphs
    Zhou, Sizhong
    COMPTES RENDUS MATHEMATIQUE, 2009, 347 (21-22) : 1223 - 1226
  • [22] AN INDEPENDENT SET DEGREE CONDITION FOR FRACTIONAL CRITICAL DELETED GRAPHS
    Gao, Wei
    Guirao, Juan Luis Garca
    Abdel-Aty, Mahmoud
    Xi, Wenfei
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES S, 2019, 12 (4-5): : 877 - 886
  • [23] Toughness for Fractional (2, b, k)-Critical Covered Graphs
    Su-Fang Wang
    Wei Zhang
    Journal of the Operations Research Society of China, 2023, 11 : 197 - 205
  • [24] Binding numbers for fractional (a, b, k)-critical covered graphs
    Zhou, Sizhong
    Liu, Hongxia
    Xu, Yang
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2020, 21 (02): : 115 - 121
  • [25] Toughness for Fractional (2, b, k)-Critical Covered Graphs
    Wang, Su-Fang
    Zhang, Wei
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023, 11 (01) : 197 - 205
  • [26] A sufficient condition for the existence of fractional (g, f, n)-critical covered graphs
    Wu, Jie
    arXiv, 2023,
  • [27] A sufficient condition for the existence of fractional (g, f, n)-critical covered graphs
    Wu, Jie
    FILOMAT, 2024, 38 (06) : 2177 - 2183
  • [28] A new degree condition for graphs to have [a, b]-factor
    Li, JX
    DISCRETE MATHEMATICS, 2005, 290 (01) : 99 - 103
  • [29] An isolated toughness condition for graphs to be fractional (a, b, k)-critical graphs
    Zhou, Sizhong
    Pan, Quanru
    UTILITAS MATHEMATICA, 2013, 92 : 251 - 260
  • [30] A SUFFICIENT CONDITION FOR ALL FRACTIONAL [a, b] - FACTORS IN GRAPHS
    Jiang, Jiashang
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2018, 19 (02): : 315 - 319