The \((p,q)\)-total labeling problem for trees (Q408175)
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: The (p,q)-total labeling problem for trees |
scientific article; zbMATH DE number 6019363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((p,q)\)-total labeling problem for trees |
scientific article; zbMATH DE number 6019363 |
Statements
The \((p,q)\)-total labeling problem for trees (English)
0 references
29 March 2012
0 references
\((p,q)\)-total labeling
0 references
\(L(p,q)\)-labeling
0 references
tree
0 references
graph algorithm
0 references
distance constrained labeling
0 references
0 references
0.99999976
0 references
0.94092745
0 references
0.9177922
0 references
0 references
0.9088324
0 references
0 references
0.90265137
0 references
