Connected permutation graphs (Q2455587): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4146776 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545841 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerative aspects of certain subclasses of perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3183088 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4471290 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344108 / rank | |||
Normal rank |
Latest revision as of 11:54, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connected permutation graphs |
scientific article |
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