1Assistant Professor, Dept. of Mathematics, Madanapalle Institute of Technology and Science, Madanapalle
2Assistant Professor, Dept. of Mathematics, Sri Vidyaniketan Engineering College, Tirupati
3Assistant Professor, Dept. of Mathematics, Aurora's Technological and Research Institute, Hyderabad
4Assistant Professor, Dept. of Mathematics, Madanapalle Institute of Technoogy and Science, Madanapalle
A path of maximum length in a connected graph G(V, E) is called a detour path between u and v, and is denoted by ∂(u, v). For any vertex u in a connected graph G, we define the length of a detour path in a graph G is called the detour number of G, and is denoted by ∂(G). i.e. ∂(G) = max { ∂(u): u ∈V(G) }. In this paper we study on several bounds on graph-theoretic parameters in terms of the detour number.
Connected graph, Hamiltonian and Detour number
