I'd like to construct a graph that approximates a sphere in 3-space, but I'm placed under the following constraints:


(1) - I am only allowed to use a construction block, $v\_i$, consisting of a single vertex with $N$ edges of uniform length $L$.


(2) - The edges must exhibit rotational symmetry around any $v\_i$ similar to the petals of a flower. The inner angle between any two edges across some $v\_i$, $\theta(i)$, may be selected as desired, but it must hold for all possible pairs of edges for that instance of the building block. For practical reasons, I'll restrict the number of possible instances of $v\_i$, and equivalently values of $\theta(i)$, to two or three. 


(3) - When joining two vertices together, any two edges may be connected, but no bending is allowed. In other words, I should be able to draw a straight line between vertices across any two connected edges. As such, the distance between vertices across two connected edges should be $2L$.


Provided these constraints, for what values of $N$ (i.e. number of edges around $v$), and values of $\theta(i)$, is it possible to construct a closed surface (a sphere for example) from the building block $v$, and what are the properties of the closed surface? How many copies of $v$ are required? 


Any and all feedback is appreciated!




---


Update: Instead of saying "approximates a sphere" I should say - "generates a closed surface". Eccentric and deformed spheres are certainly reasonable. Also (and with apologies to André Henriques!), I'm going to reformulate the question to allow for more than one interior bending angle $\theta(i)$ (two or at most three to hopefully keep the question reasonable).



Constructing a graph that approximates a sphere using rotationally symmetric building blocks with equal numbers of edges
I think that your constraints are very restrictive, and that the only possibilities are the 5 Platonic solids: tetrahedron, octahedron, cube, icosahedron, and dodecahedron.


