To search, Click
below search items.
Published Papers Search Service
A connected graph with non-concurrent Longest Paths
ABDUL HAMEED JUNEJO, ABDUL NAEEM KALHORO, ISRAR AHMED, INAYATULLAH SOOMRO, RAZA MUHAMMAD, IMDAD ALI JOKHIO, ROZINA CHOHAN, ALI DINO JUMANI
Vol. 19 No. 4 pp. 252-254
In this an example of graph is presented with the property that each vertex is missed by some longest Paths.
Hamiltonian path longest path Hypo-traceable Gallai’s property P ?_i^j