Isomorphic Types on Graphs: 1-Neighborhood Random Tree Graphs

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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 edges within this vertex set. The first eight isomorphic types are shown in the legend.


This Demonstration shows unique coloring for all vertices with a valency of three or less, and black for vertices with a valency greater than three.


Contributed by: John Cicilio (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.