Type:

Other

Description:

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 valency of three or less, and black for all vertices with a valency greater than three.

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:398052,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/IsomorphicTypesOnGraphs1NeighborhoodRandomGridGraphs/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467