𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal Polygons with Minimal Perimeter

✍ Scribed by á.G. Horváth

Book ID
111533370
Publisher
Springer Netherlands
Year
1997
Tongue
English
Weight
361 KB
Volume
34
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polygonal chains with minimal energy
Polygonal chains with minimal energy
✍ Juan Rada; Antonio Tineo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 138 KB

The energy of a graph G is defined as E(G) = p i=1 |λ i |, where λ i (i = 1, . . . , p) are the eigenvalues of the adjacency matrix of G. We show that among all polygonal chains with polygons of 4n -2 vertices (n 2), the linear polygonal chain has minimal energy.

Steiner minimal trees on regular polygon
Steiner minimal trees on regular polygons with centre
✍ J.F. Weng; R.S. Booth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Let P,,n~>3, be the set of vertices of a regular n-gon and o be the centre of P,. Let P+ = P, u [o}. In this paper we determine the Steiner minimal trees on P+. By this example we will see how complicated the Steiner problem may become if even one regular point not lying on the Steiner polygon is ad