# Isomorphic Types on Graphs: 1-Neighborhood Random Grid Graphs

Requires a Wolfram Notebook System

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

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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.

[more]
Contributed by: John Cicilio (March 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

detailSectionParagraph## Permanent Citation

"Isomorphic Types on Graphs: 1-Neighborhood Random Grid Graphs"

http://demonstrations.wolfram.com/IsomorphicTypesOnGraphs1NeighborhoodRandomGridGraphs/

Wolfram Demonstrations Project

Published: March 7 2011