EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS

被引：0

作者：

Niel, Blanca I. ^{[1
]}

机构：

[1] UNS, Dept Matemat, Ave Alem 1253,B8000CPB, Bahia Blanca, Buenos Aires, Argentina

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2012年 / 4卷 / 04期

关键词：

Hamiltonian path; extremal problems; Euclidean geometric problem; furthest neighbor tours; Traveling salesman problem;

D O I：

10.1142/S1793830912500577

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We single out every longest path of n-1 order that solves each of the n/2 Longest Euclidean Hamiltonian Path Problems on the even nth root of the unity, by means of a geometric and arithmetic procedure. This identification is done regardless of planar rotations and orientation. In addition, the uniqueness of the Euclidean Hamiltonian cycle that resolves the Maximum Traveling Salesman Problem is shown.

引用

页数：16

共 50 条

[1] Convex n-gons
Cahill, ND
AMERICAN MATHEMATICAL MONTHLY, 2003, 110 (06): : 545 - 546
[2] NEAR N-GONS
SHAD, S
SHULT, E
PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS, 1980, 37 : 461 - 463
[3] QUADRATIC N-GONS
BUOFF, D
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A202 - A202
[4] NESTING REGULAR N-GONS
不详
AMERICAN MATHEMATICAL MONTHLY, 1982, 89 (07): : 503 - 503
[5] Commensurable diagonals in regular n-gons
Vincenzi, Giovanni
Paolillo, Bonaventura
Rizzo, Piermichele
INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY, 2022, 53 (10) : 2831 - 2836
[6] Pratt sequences and n-gons
Shephard, GC
DISCRETE MATHEMATICS, 2000, 221 (1-3) : 125 - 154
[7] NESTING REGULAR N-GONS
TROESCH, BA
AMERICAN MATHEMATICAL MONTHLY, 1981, 88 (02): : 152 - 152
[8] Fractal n-gons and their Mandelbrot sets
Bandt, Christoph
Hung, Nguyen Viet
NONLINEARITY, 2008, 21 (11) : 2653 - 2670
[9] TRANSFORMING N-GONS BY FOLDING THE PLANE
SABININ, P
STONE, MG
AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (07): : 620 - 627
[10] 109.13 Apollonius' theorem for n-gons
Bushnell, Karl
MATHEMATICAL GAZETTE, 2025, 109 (574): : 153 - 156

← 1 2 3 4 5 →