A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs |
scientific article |
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
