m-Bonacci graceful labeling
| Autor: | Helda Princy Rajendran, Kalpana Mahalingam |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
010102 general mathematics
0102 computer and information sciences 01 natural sciences Physics::Geophysics Combinatorics Set (abstract data type) graceful graph 010201 computation theory & mathematics Graceful labeling Physics::Space Physics QA1-939 Discrete Mathematics and Combinatorics Graph (abstract data type) m-bonacci number 0101 mathematics Computer Science::Databases Mathematics MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021) |
| ISSN: | 2543-3474 0972-8600 |
| 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: | OpenAIRE |
| Externí odkaz: |
|