A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562)
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 6082053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs |
scientific article; zbMATH DE number 6082053 |
Statements
A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (English)
0 references
13 September 2012
0 references
\((2,1)\)-total labeling
0 references
outerplanar graph
0 references
maximum degree
0 references
distance constrained labeling
0 references
0.95412207
0 references
0.9503354
0 references
0.90366226
0 references
0.9036622
0 references
0.9016443
0 references
0.9003821
0 references
