Isomorphic Types on Graphs: One-Neighborhood Gödel Sections

One-neighborhood isomorphic types can be sectioned into neighborhoods themselves. These neighborhoods of types can be uniquely numbered using a Gödel numbering scheme. Each section is a combination of a set of isomorphic types. This Demonstration is motivated to inspire further research on movements of sections on graphs during a graph rewriting evolution.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


These are the 209 one-neighbor isomorphic types with , numbered from left to right and top to bottom:
In the Demonstration, each vertex is labeled with the number of its one-neighbor isomorphic type. Then given a vertex, here called an anchor (shown in red), a neighborhood of the anchor is specified (shown in blue). The Gödel section number is calculated by tallying the number of isomorphic types and then building the value using the product of for each isomorphic type in the neighborhood, where is the prime, is the number of the isomorphic type, and is the tally.
I created this type of counting for graphs to help quantify and compare neighborhoods for my future research.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.