Cycle Properties of s-Vertex Connected Graphs
Xing Bin Ma, Xiao Yan Liu, Lai Liang Zhang, Qiang Lv · Advanced materials research · 2013
The cycle properties of-vertex connected graph are studied as follows pancyclicity and fully cycle extensibility. Two conclusions are drawn by way of argument: Let be a-vertex connected graph, if ,then is fully cycle extendable. Here the upper bound of is best possible. Let be a-vertex connected graph, if ,then is a pancyclic graph or .