Excising Edges from Cubic 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.

In a graph, the number of edges leading to a vertex is its valence. If an edge connects two vertices of valence three, that edge and its vertices can be deleted to form a new graph. Both edge excision and its opposite, edge insertion, are widely used in the study of cage graphs. The graphs at the bottom are all possible distinct excisions of various cubic graphs.

Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


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.
Send