THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there i...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2022-12-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5091 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious labeling on a graph is an injective function so that there is a bijective function where for each . In this paper, we discuss how to build new labeling (harmonious, odd harmonious, even harmonious) based on the existing labeling (harmonious, odd harmonious, even harmonious) |
|---|---|
| ISSN: | 1978-7227 2615-3017 |