m-Bonacci graceful labeling
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show that complete graphs, complete bipartite graphs, ge...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2021.1876505 |
| Summary: | We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show that complete graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs are not m-bonacci graceful. Almost all trees are m-bonacci graceful. We give m-bonacci graceful labeling to cycles, friendship graphs, polygonal snake graphs, and double polygonal snake graphs. |
|---|---|
| ISSN: | 0972-8600 2543-3474 |