On critical nets in R^k

From MaRDI portal
Publication:2025656




Abstract: Critical nets in mathbbRk (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices (leaves) have a fixed position. In contrast to what happens on generic manifolds, we show that, if n is the number of 1-valent vertices, the total length of the edges not incident with a 1-valent vertex is bounded by rn (where r is the outer radius), the degree of any vertex is bounded by n and that the number of edges (and hence the number of vertices) is bounded by nl where l is related to the combinatorial diameter of the graph.









This page was built for publication: On critical nets in \({\mathbb{R}}^k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025656)