Hamiltonian Cycles in Faulty Random Geometric Networks
نویسنده
چکیده
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks. A random geometric network is a graph whose vertices correspond to points uniformly and independently distributed in the unit square, and whose edges connect any pair of vertices if their distance is below some specified bound. A faulty random geometric network is a random geometric network whose vertices or edges fail at random. Algorithms to find Hamiltonian cycles in faulty random geometric networks are presented.
منابع مشابه
Fault-Free Hamiltonian Cycles in Faulty Butterfly Graphs
The butterfly graphs were originally defined as the underlying graphs of FFT networks which can perform the fast Fourier transform (FFT) very eficiently. Since butterfly graphs are regular of degree four, it can tolerate at most two edge faults in the worst case in order to establish a Hamiltonian cycle. In this paper, we show that butterfly graphs contain a fault-free Hamiltonian cycle even if...
متن کاملProbability HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS
We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penrose. We also show that in the k-nearest neighbour model, there is a constant κ such that almost every κ-connected graph has a Hamilton cycle.
متن کاملBifurcation of limit cycles from a quadratic reversible center with the unbounded elliptic separatrix
The paper is concerned with the bifurcation of limit cycles in general quadratic perturbations of a quadratic reversible and non-Hamiltonian system, whose period annulus is bounded by an elliptic separatrix related to a singularity at infinity in the poincar'{e} disk. Attention goes to the number of limit cycles produced by the period annulus under perturbations. By using the appropriate Picard...
متن کاملHamilton Cycles in Random Geometric Graphs
We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This proves a conjecture of Penrose. We also show that in the k-nearest neighbour model, there is a constant κ such that almost every κ-connected graph has a Hamilton cycle.
متن کاملOn the mutually independent Hamiltonian cycles in faulty hypercubes
Two ordered Hamiltonian paths in the n-dimensional hypercube Qn are said to be independent if i-th vertices of the paths are distinct for every 1 ≤ i ≤ 2n. Similarly, two s-starting Hamiltonian cycles are independent if i-th vertices of the cycle are distinct for every 2 ≤ i ≤ 2n. A set S of Hamiltonian paths and sstarting Hamiltonian cycles are mutually independent if every two paths or cycles...
متن کامل