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...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | EJournal Article |
| Wydane: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
| Hasła przedmiotowe: | |
| Dostęp online: | Get Fulltext |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|
Internet
Get Fulltext3rd Floor Main Library
| Sygnatura: |
A1234.567 |
|---|---|
| Egzemplarz 1 | Dostępne |