BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let G be a graph, and let a, b, k be integers with 0 ≤ a ≤ b, k ≥ 0. Then graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this paper, the relationship between binding number bind(G) and (a, b, k)-critical graph is discussed, and a binding number condition for a graph to be (a, b, k)-critical is given.
Abstract
Let G be a graph, and let a, b, k be integers with 0 ≤ a ≤ b, k ≥ 0. Then graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this paper, the relationship between binding number bind(G) and (a, b, k)-critical graph is discussed, and a binding number condition for a graph to be (a, b, k)-critical is given.
참고문헌 (8)
- J. A. Bondy, "Graph Theory with Applications" (1976), American Elsevier Publishing Co., Inc.
- M. Cai, "(2 k)-factor-critical graphs and toughness", Graphs and Combinatorics, 15(2), pp.137~142 (1999)
- H. Enomoto, "Toughness and the existence of k-factors. IV", Discrete Mathematics, 216(1), pp.111~120 (2000)
- G. Liu, "(a; b; k)-critical graphs", Advances in Mathematics (China), 27(6), pp.536~540 (1998)
- M. Shi, "(3 k)-factor-critical graphs and toughness", Graphs and Combinatorics, 15(4), pp.463~471 (1999)
- D. R. Woodall, "The binding number of a graph and its Anderson number", Journal of Combinatorial Theory Series B, 15, pp.225~255 (1973)
- Q. Yu, "Characterizations of various matching extensions in graphs", The Australasian Journal of Combinatorics, 7, pp.55~64 (1993)
- S. Z. Zhou, "Sufficient conditions for (a; b; k)-critical graphs", Journal of Jilin University Science Edition, 43(5), pp.607~609 (2005)