The Parth of the 3-Closure of the(K_(1,4);2)-graph
Sumei Zhang · Science Technology and Engineering · 2010
Let G be a(K1,4;2)-graph which is a K1∨P5 or T3-free graph.For two vertice of the graph G denoted by a and b,a vertex of graph G denoted by x which is an eligible and locally 3-connected vertex,a graph denoted by G′ is got by locally completed the graph G at the vertex x.It is shown that if there is a(a,b)-path with the length of m in G′,then there is a(a,b)-path with the length of m in G.