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...
Saved in:
Main Authors: | , |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |