Harmonious graphs from α-trees
Two of the most studied graph labelings are the types of harmonious and graceful. A harmonious labeling of a graph of size m and order n, is an injective assignment of nonnegative integers smaller than m, such that the weights of the edges, which are defined as the sum of the labels of the end-verti...
Shranjeno v:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Izdano: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
| Teme: | |
| Online dostop: | Get Fulltext |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Internet
Get Fulltext3rd Floor Main Library
| Signatura: |
A1234.567 |
|---|---|
| Kopija 1 | Prosto |