Title of article
Two sufficient conditions for the existence of path factors in graphs
Author/Authors
Zhou, S. School of Science - Jiangsu University of Science and Technology, Mengxi, China , Yang, F. School of Science - Jiangsu University of Science and Technology, Mengxi, China , Xu, L. Department of Mathematics - Changji University, Changji, Xinjiang, China
Pages
5
From page
3510
To page
3514
Abstract
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 graphG is called a (P≥n, m)-factor deleted graph if ..
Keywords
P≥n-factor , Network , (P≥n, m)-factor deleted graph , (P≥n, k)-factor critical graph , toughness , connectivity
Journal title
Scientia Iranica(Transactions D: Computer Science and Electrical Engineering)
Serial Year
2019
Record number
2527631
Link To Document