•  15
    Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
    with Sakander Hayat, Suliman Khan, and Jia-Bao Liu
    Complexity 2021 1-23. 2021.
    A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engineering. The detour index of a graph is defined to be the sum of lengths of detours between all the unordered pairs of vertices. The detour index has diverse applications in chemistry. Computing the d…Read more