Permutations représentatives d'un graphe à seuil (Q795850)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Permutations représentatives d'un graphe à seuil |
scientific article |
Statements
Permutations représentatives d'un graphe à seuil (English)
0 references
1984
0 references
It is known that, if G is a threshold graph, then G is also a permutation graph. In this article the author gives a way of getting all representative permutations of G and an explicit counting formula of all these permutations.
0 references
threshold graph
0 references
permutation graph
0 references
