|
|
|
|
two sufficient conditions for the existence of path factors in graphs
|
|
|
|
|
|
|
|
نویسنده
|
zhou s. ,yang f. ,xu l.
|
|
منبع
|
scientia iranica - 2019 - دوره : 26 - شماره : 6-D - صفحه:3510 -3514
|
|
چکیده
|
A graph g is called a (p≥n, k)-factor critical graph if g − u has a p≥ n -factor for any u ⊆ v(g) with|u|=k. a graph g is called a (p≥n, m)-factor deleted graph if g−e' contains a p≥n -factor for any e' ⊆ e(g) with |e|=m. in this paper, we obtain two results for graphs to be (p≥n, k)-factor critical graphs or (p≥n, m)-factor deleted graphs. the two results are best possible in some conditions.
|
|
کلیدواژه
|
network ,p≥ n-factor ,(p≥n ,m)-factor ,deleted graph ,(p≥n ,k)-factor critical graph ,toughness ,connectivity
|
|
آدرس
|
jiangsu university of science and technologymengxi road 2, school of science, china, jiangsu university of science and technology, school of science, china, changji university, department of mathematics, china
|
|
پست الکترونیکی
|
xulan6400@163.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|