A Two-Connected Graph with Gallai's Property

Abdul Naeem Kalhoro, Ali Dino Jumani
2019 Advances in Wireless Communications and Networks  
The most famous examples of Hypo-Hamiltonian graph is the Petersen graph. Before the discovery of Hypo-traceable graphs, Tibor Gallai, in 1966, raised the question whether the graphs in which each vertex is missed by some longest path. This property will be called Gallai's property, various authors worked on that property. In 1969, Gallai's question was first replied through H. Walther[2], who introduced a planar graph on 25 vertices satisfying Gallai's criterion. Furthermore, H. Walther and H.
more » ... Voss [3] and Tudor Zamfirescu introduced the graph with 12 vertices and it was guessed that order 12 is the smaller possibility of such a graphLater the question was modifies by Tudor Zamfirescu and asked that whether there exists graphs of Paths and Cycles, that is to say i-connected graphs (planar or non-planar respectively), such that each set of j points are disjoint from some longest paths or cycles., Several good examples answering Tudor Zamfirescu's questions were published. In this note a graphs is developed with the property that everyone vertex is missed by some longest cycle with connectivity 2, satisfying Gallai's property. The designed graphs can be useful in various fields of science and technology including computational geometry, networking, theoretical computer science and circuit designing.
doi:10.11648/j.awcn.20190501.14 fatcat:cems36b3e5d3jjlugdxp4htjqi