Petersen family (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "thumb|The Petersen family, a family of seven graphs reachable from the complete graph K6 and the Petersen graph by Δ-Y and Y-Δ transforms.In gra...") |
No edit summary |
||
Line 1: | Line 1: | ||
[[File:Petersen_family.png|thumb|The Petersen family, a family of seven graphs reachable from the complete graph K6 and the Petersen graph by Δ-Y and Y-Δ transforms.]]In | [[File:Petersen_family.png|thumb|The Petersen family, a family of seven graphs reachable from the complete graph K6 and the Petersen graph by Δ-Y and Y-Δ transforms.]]In [[Graph theory (nonfiction)|graph theory]], the '''Petersen family''' is a set of seven undirected graphs that includes the Petersen graph and the complete graph K6. | ||
The Petersen family is named after Danish mathematician [[Julius Petersen (nonfiction)|Julius Petersen]]. | The Petersen family is named after Danish mathematician [[Julius Petersen (nonfiction)|Julius Petersen]]. | ||
Line 11: | Line 11: | ||
== Fiction cross-reference == | == Fiction cross-reference == | ||
* [[Gnomon algorithm]] | |||
* [[Mathematics]] | |||
== Nonfiction cross-reference == | == Nonfiction cross-reference == | ||
* [[Julius Petersen (nonfiction)]] | * [[Julius Petersen (nonfiction)]] | ||
* [[Graph theory (nonfiction)]] | |||
* [[Mathematics (nonfiction)]] | * [[Mathematics (nonfiction)]] | ||
Line 22: | Line 26: | ||
[[Category:Nonfiction (nonfiction)]] | [[Category:Nonfiction (nonfiction)]] | ||
[[Category:Graph theory (nonfiction)]] | |||
[[Category:Mathematics (nonfiction)]] | [[Category:Mathematics (nonfiction)]] |
Latest revision as of 18:59, 8 December 2017
In graph theory, the Petersen family is a set of seven undirected graphs that includes the Petersen graph and the complete graph K6.
The Petersen family is named after Danish mathematician Julius Petersen.
Any of the graphs in the Petersen family can be transformed into any other graph in the family by Δ-Y or Y-Δ transforms, operations in which a triangle is replaced by a degree-three vertex or vice versa. These seven graphs form the forbidden minors for linklessly embeddable graphs, graphs that can be embedded into three-dimensional space in such a way that no two cycles in the graph are linked. They are also among the forbidden minors for the YΔY-reducible graphs.
In the News
Fiction cross-reference
Nonfiction cross-reference
External links:
- Petersen family @ Wikipedia