Permutations représentatives d'un graphe à seuil (Q795850)
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 3863257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permutations représentatives d'un graphe à seuil |
scientific article; zbMATH DE number 3863257 |
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
0.7930148243904114
0 references
0.7528020739555359
0 references
0.7522688508033752
0 references
0.7515591382980347
0 references
0.7432065010070801
0 references
