Wolfram Research

Mathematica MathWorld Wolfram Science More »

Excising Edges from Cubic Graphs


	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

Graph Excision (Wolfram MathWorld)

"Excising Edges from Cubic Graphs" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ExcisingEdgesFromCubicGraphs/

Contributed by: Ed Pegg Jr

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Graph Theory

Browse all topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+