| Author |
Comment/Response |
Zhiyu Fan
|
 09/20/10 05:41am
Hallo all,
we could use GridGraph[3,3] to construct a graph, in which every vertex can connect only with the nearst-neighbor vertex.
we could also use CompleteGraph[9] to construct a graph, in which every vertex can connect with all other vertex.
my question is, how can we construct a graph, in which every vertex can connect with the nearst and 2nd nearst or 3rd nearst-neighbor vertex.
thank in advance
Zhiyu Fan
URL: , |
|
