I am trying to find a function / algorithm that will search and find a mapping between an irregular graph (say, N-nodes with maximum vertex degree-K but otherwise irregular) into a regular L-nearest neighbor graph with also N-nodes. I know that if L equals N, there is a trivial mapping where we simply place the irregular graph into this complete graph and disconnect all the unnecessary connections.
This comes very close to FindGraphIsomorphism but it isn't quite that since GraphIsomorphism looks for exact mappings between two graphs, here I am simply looking for an embedding.
Is there an easy function known for this purpose that I don't know?
Thanks in advance.