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

来源：

INFORMATION PROCESSING LETTERS | 2019年 / 143卷

基金：

中国国家自然科学基金;

关键词：

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 条

[31] A toughness condition for fractional (k, m)-deleted graphs
Zhou, Sizhong
Sun, Zhiren
Ye, Hui
INFORMATION PROCESSING LETTERS, 2013, 113 (08) : 255 - 259
[32] A DEGREE CONDITION IMPLYING ORE-TYPE CONDITION FOR EVEN [2,b]-FACTORS IN GRAPHS
Tsuchiya, Shoichi
Yashima, Takamasa
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (03) : 797 - 809
[33] 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
[34] Binding Numbers for all Fractional (a, b, k)-Critical Graphs
Zhou, Sizhong
Bian, Qiuxiang
Sun, Zhiren
FILOMAT, 2014, 28 (04) : 709 - 713
[35] An improvement of the previous result on fractional (a,b,k)-critical covered graphs
Xiangyang Lv
Indian Journal of Pure and Applied Mathematics, 2024, 55 : 40 - 46
[36] Research on Fractional Critical Covered Graphs
S. Wang
W. Zhang
Problems of Information Transmission, 2020, 56 : 270 - 277
[37] Some results on fractional covered graphs
Yu, Jiguo
Wang, Na
Cao, Baoxiang
OPERATIONS RESEARCH AND ITS APPLICATIONS, 2006, 6 : 334 - +
[38] A neighborhood condition for all fractional (a, b, k)-critical graphs
Jiang, Jiashang
ARS COMBINATORIA, 2019, 142 : 55 - 63
[39] A degree condition for a graph to have [a,b]-factors
Li, YJ
Cai, MC
JOURNAL OF GRAPH THEORY, 1998, 27 (01) : 1 - 6
[40] A sufficient condition for a graph to be a fractional (a, b, n)-critical deleted graph
Gao, Wei
ARS COMBINATORIA, 2015, 119 : 377 - 390

← 1 2 3 4 5 →