Mathematics – Combinatorics
Scientific paper
2009-10-13
Mathematics
Combinatorics
20 pages, 25 figures
Scientific paper
Consider graphs embedded in a Riemannian manifold, attached at $n$ fixed
points. Say such a graph is minimal if it is a critical point of the length
functional. In this paper, we give a sharp upper bound for the maximal number
of vertices of planar 3-regular minimal graphs.
No associations
LandOfFree
On the Maximum Number of Vertices of Minimal Embedded Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Maximum Number of Vertices of Minimal Embedded Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Maximum Number of Vertices of Minimal Embedded Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18337