𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polygonal chains with minimal energy

✍ Scribed by Juan Rada; Antonio Tineo


Book ID
104155582
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
138 KB
Volume
372
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Filling polygonal holes with minimal ene
✍ D. Barrera; M.A. Fortes; P. GonzΓ‘lez; M. Pasadas πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 706 KB

In this paper we present two different methods for filling in a hole in an explicit 3D surface, defined by a smooth function f in a part of a polygonal domain D βŠ‚ R 2 . We obtain the final reconstructed surface over the whole domain D. We do the filling in two different ways: discontinuous and conti