+ degT (N(vj))], where dT (vi, vj) is the distance between the vertices vi, vj ∈ V (T ), is equal to the length of the shortest path starting at vi and ending at vj and degT (N(v)) is the cardinality of degT (u), where uv ∈ E(T ). In this paper, trees with minimum and maximum A are characterized and the expressions for the Ashwini index are obtained for detour saturated trees T3(n), T4(n) as we...

The central nervous system exhibits remarkable plasticity in early life. Prenatal morphine exposure may induce adverse behavioral effects on the neonate and the developing offspring. In the present study, we investigated the effect of prenatal morphine exposure (daily from embryonic days 12-16, 20mg/kg) on 11-day-old chicks using two forms of spatial paradigms: one trial detour behavior task in...

A path P connecting a pair of vertices in connected fuzzy graph is called detour, if its μ - length maximum among all the feasible paths between them. In this paper we establish notion detour convex sets, covering, basis, number, blocks and investigate some their properties. It has been proved that, for complete G, set any G covering. necessary sufficient condition to become block also establis...

A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y ∈ V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at most k. Such subgraphs sometimes also are called additive spanners. In this paper, we study k-detour subgraphs of the n-dimensional cube, Qn, with few edges or with moderate maximum degree. Let ∆(k, n) denote the minimu...

The performance of content distribution on the Internet is crucial for many services. While popular content can be delivered efficiently to users by caching it using content delivery networks, the distribution of less popular content is often constrained by the bandwidth of the Internet path between the content server and the client. Neither can influence the selected path and therefore clients...

Tree routing is one of the detouring strategies employed in geographic routing to help find a detour for a packet to leave a local minimum. The effectiveness of tree routing depends on the quality of the pre-constructed routing trees. Existing tree construction methods build trees in a top-down and centralized fashion and do not consider the traffic pattern and residual energy of the network. T...