The detour pebbling number of a graph \(G\) is the least positive integer \(f^{*}(G)\) such that these pebbles are placed on vertices \(G\), we can move pebble to target vertex by sequence moves each taking two off and placing one an adjacent using path. In this paper, compute for commutative ring zero-divisor graphs, sum product zero divisor graphs.

Routing is a critical function in adhoc network which claim special attention and support extended by the trustable neighbor nodes. The peril of Gratuitous detour on routing process in ad hoc network is manifold which culminates in the deterioration of network performance amounting to deplorable network behavior. Routing in ad hoc network is a cooperative process as it requires periodic assista...

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (l ii ), yields a topological centrality index, defined as C (i) = 1/l ii . In turn, the sum of reciprocals of individual node centralities, ∑ i 1/C (i) ...

Octopuses will make detours down an opaque corridor in order to reach crabs initially visible but not directly accessible to them (Wells, 1964). The situation can be used to investigate the function of parts of the brain in short-term learning and in interocular transfer. In a previous account the effects of removing the vertical lobe were considered. If this lobe is removed from the visual lea...

Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So finding a connection between big cities is quite easy. These places are on a list of designated origin and destination points. But when you want to go from a small town to another small town, even when they are next to a...