m-Bonacci graceful labeling
| Autor: | Kalpana Mahalingam, Helda Princy Rajendran |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021) |
| Druh dokumentu: | article |
| ISSN: | 0972-8600 2543-3474 09728600 |
| DOI: | 10.1080/09728600.2021.1876505 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|