Open Access
Subscription Access
Open Access
Subscription Access
A Study on Detour Number
Subscribe/Renew Journal
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.
Keywords
Connected Graph, Hamiltonian and Detour Number.
Subscription
Login to verify subscription
User
Font Size
Information
- Chartrand, Gary, Henry Escuadro, and Ping Zhang. "Detour distance in graphs." Journal of Combinatorial Mathematics and Combinatorial Computing53 (2005): 75-94.
- Chartrand, Gary, Garry L. Johns, and Ping Zhang."On the detour number and geodetic number of a graph."Ars Combinatoria 72 (2004): 3-15.
- Chartrand, Gary, et al. "Detour domination in graphs." Ars Combinatoria 71 (2004): 149-160.
- Kapoor. S. F., Kronk. H. V., Lick. D. R., On detours in graphs , Canad. Math. Bull., 11 (1968), pp. 195-201.
- Ore, O. "Hamiltonian connected graph." J. Math. Pures Appli 42 (1963): 121-127.
Abstract Views: 314
PDF Views: 0