http://demonstrations.wolfram.com/IsomorphicTypesOnGraphs1NeighborhoodRandomG...
The Wolfram Demonstrations Project contains thousands of free interactive visualizations, with new entries added daily.
Any vertex in a graph can be uniquely numbered (here they are colored) based on its one-neighborhood isomorphic type. A one-neighborhood isomorphic type is a graph isomorphism of the graph on all vertices of distance one from the given vertex with all e...
Contributed by: John Cicilio
Link to this comment:
All Comments (0)