\(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.11.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000225603 / rank | |||
Normal rank | |||
Revision as of 01:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L(j,k)\)-labelling and maximum ordering-degrees for trees |
scientific article |
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
