Given a node $i$ and the number of vertices $n_i$ that it must have in a regular planar lattice graph, for instance, a triangle $n_i = 3$ or a square $n_i = 4$, is there a general rule that returns the set of neighbours of the node $i$?
Is there any solution for general planar graphs?
Is there any solution for lattice graphs with cells represented by a 3D polyhedron?
What about a multi-dimensional regular object, like a hyper-cube?
Any information about what the aforementioned problem is called would be greatly appreciated as currently, I am failing at finding articles.
$\endgroup$ Reset to default
