Isomorphic Types on Graphs: 1-Neighborhood Random Grid Graphs

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
191 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 8, 2010

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

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (0)

Sign In or Sign Up now to post a comment!
Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more