Open AccessA binding number condition for graphs to be (a,b,k)-critical graphs
Author(s) -
Sizhong Zhou,
Jiashang Jiang,
Lan Xu
Publication year - 2012
Publication title -
arab journal of mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 11
eISSN - 2588-9214
pISSN - 1319-5166
DOI - 10.1016/j.ajmsc.2012.01.001
Subject(s) - mathematics , combinatorics , graph , integer (computer science) , discrete mathematics , programming language , computer science
Let a and b be two even integers with 2⩽a(a+b-1)(n-1)bn-(a+b)-bk+3 and n⩾(a+b)(a+b-3)b+bkb-1. Furthermore, it is shown that the result in this paper is best possible in some sense
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom