• Y. Sherlin Nisha
• V. Rajeswari
• Y. Merlin Nisha

Among discrete mathematics, graph theory is a highly popular and interesting field. In 1736, E.Euler published the first known article on graph theory, which described the seven bridges of K¨onigsberg.If every pair of a graph’s vertices has a Hamiltonian path connecting them, the graph is said to be Hamilton-connected. It is an NP-complete task to determine if a graph is Hamilton-connected. We demonstrate the Hamiltonian connection between the line graphs of the generalized Petersen, antiprism, and wheel graphs by using these proof strategies. Incorporating it with some existing

Detour index, maximum distance, elongated path, hamiltonian properties, Hamilton- connected.

"On Certain Hamiltonian Properties of WK-Recursive Networks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 12, page no.e583-e589, December-2024, Available :http://www.jetir.org/papers/JETIR2412465.pdf

"On Certain Hamiltonian Properties of WK-Recursive Networks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 12, page no. ppe583-e589, December-2024, Available at : http://www.jetir.org/papers/JETIR2412465.pdf