\(L(0,1)\)-labelling of permutation graphs (Q894561)
From MaRDI portal
!
WARNING
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 6515175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L(0,1)\)-labelling of permutation graphs |
scientific article; zbMATH DE number 6515175 |
Statements
\(L(0,1)\)-labelling of permutation graphs (English)
0 references
1 December 2015
0 references
frequency assignment problem
0 references
\(L(0,1)\)-labelling
0 references
permutation graph
0 references
0 references
0 references
0.8836579322814941
0 references
0.8522261381149292
0 references
0.8296297788619995
0 references
0.8200819492340088
0 references
0.8078677654266357
0 references
