Two sufficient conditions for the existence of path factors in graphs

نویسندگان
Momeni, B. ID 1
Kharrazi, M. ID 2

1 Department of Computer Engineering, Sharif University of Technology, Tehran, P.O. Box 11155/1639, Iran

2 Department of Computer Engineering, Sharif University of Technology, Tehran, P.O. Box 11155/1639, Iran

doi
10.24200/sci.2018.5151.1122
چکیده

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.............

کلیدواژه‌ها
Network, P≥n-factor, (P≥n, m)-factor, deleted graph, (P≥n, k)-factor critical graph, toughness, connectivity