\(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198)
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 5703773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L(j,k)\)-labelling and maximum ordering-degrees for trees |
scientific article; zbMATH DE number 5703773 |
Statements
\(L(j,k)\)-labelling and maximum ordering-degrees for trees (English)
0 references
5 May 2010
0 references
channel assignment problem
0 references
distance-two labelling
0 references
trees
0 references
0 references
0 references
0.8634541630744934
0 references
0.8584136962890625
0 references
0.8575956225395203
0 references
0.8489120006561279
0 references
0.8362720608711243
0 references
