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...
שמור ב:
Main Authors: | , |
---|---|
פורמט: | EJournal Article |
יצא לאור: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
נושאים: | |
גישה מקוונת: | Get Fulltext |
תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
אינטרנט
Get Fulltext3rd Floor Main Library
סימן המיקום: |
A1234.567 |
---|---|
עותק 1 | זמין |