scholarly journals Lattice graphs with non-concurrent longest cycles

Author(s):  
Ali Dino Jumani ◽  
Carol Zamfirescu ◽  
Tudor Zamfirescu
2013 ◽  
Vol 313 (19) ◽  
pp. 1908-1914 ◽  
Author(s):  
Ayesha Shabbir ◽  
Tudor Zamfirescu

Cybernetics ◽  
1981 ◽  
Vol 16 (4) ◽  
pp. 628-631
Author(s):  
L. A. Klygina
Keyword(s):  

2000 ◽  
Vol 9 (6) ◽  
pp. 489-511 ◽  
Author(s):  
JOSEP DÍAZ ◽  
MATHEW D. PENROSE ◽  
JORDI PETIT ◽  
MARÍA SERNA

This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.


1998 ◽  
Vol 39 (5) ◽  
pp. 908-912 ◽  
Author(s):  
V. V. Kabanov
Keyword(s):  

2018 ◽  
Vol 338 ◽  
pp. 412-420
Author(s):  
Xing Feng ◽  
Lianzhu Zhang ◽  
Mingzu Zhang

Author(s):  
Josep Díaz ◽  
Mathew D. Penrose ◽  
Jordi Petit ◽  
María Serna
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document