Connected permutation graphs (Q2455587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5204993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connected permutation graphs |
scientific article; zbMATH DE number 5204993 |
Statements
Connected permutation graphs (English)
0 references
25 October 2007
0 references
A permutation graph is a simple graph associated with a permutation. Let \(c_n\) be the number of connected permutation graphs on \(n\) vertices. Then the sequence \(\{c_n\}\) satisfies a recurrence relation such that it provides a partition of \(n!\).
0 references
connected permutation graphs
0 references
0.7779838442802429
0 references
0.7661994695663452
0 references
0.7604370713233948
0 references
0.7595655918121338
0 references
