<i>L</i>(2, 1)-Labeling Halin Graphs with Maximum Degree Eight
Suppose that <i>T</i> is a plane tree without vertices of degree 2 and with at least one vertex of at least degree 3, and <i>C</i> is the cycle obtained by connecting the leaves of <i>T</i> in a cyclic order. Set <inline-formula><math xmlns="http://w...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-12-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/1/50 |