Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings (Q3440271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings |
scientific article; zbMATH DE number 5155747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings |
scientific article; zbMATH DE number 5155747 |
Statements
Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings (English)
0 references
22 May 2007
0 references
channel assignment problem
0 references
\(L(2
0 references
1)\)-labeling
0 references
0.8481394648551941
0 references
0.8177358508110046
0 references
0.817110002040863
0 references
