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 |
| _version_ | 1818656838299680768 |
|---|---|
| author | Kalpana Mahalingam Helda Princy Rajendran |
| author_facet | Kalpana Mahalingam Helda Princy Rajendran |
| author_sort | Kalpana Mahalingam |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-17T03:31:57Z |
| format | Article |
| id | doaj.art-499bfee6ac5f40a1a537d7216e383090 |
| institution | Directory Open Access Journal |
| issn | 0972-8600 2543-3474 |
| language | English |
| last_indexed | 2024-12-17T03:31:57Z |
| publishDate | 2021-01-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-499bfee6ac5f40a1a537d7216e3830902022-12-21T22:05:14ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742021-01-0118171510.1080/09728600.2021.18765051876505m-Bonacci graceful labelingKalpana Mahalingam0Helda Princy Rajendran1Department of Mathematics, Indian Institute of TechnologyDepartment of Mathematics, Indian Institute of TechnologyWe 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.http://dx.doi.org/10.1080/09728600.2021.1876505m-bonacci numbergraceful graph |
| spellingShingle | Kalpana Mahalingam Helda Princy Rajendran m-Bonacci graceful labeling AKCE International Journal of Graphs and Combinatorics m-bonacci number graceful graph |
| title | m-Bonacci graceful labeling |
| title_full | m-Bonacci graceful labeling |
| title_fullStr | m-Bonacci graceful labeling |
| title_full_unstemmed | m-Bonacci graceful labeling |
| title_short | m-Bonacci graceful labeling |
| title_sort | m bonacci graceful labeling |
| topic | m-bonacci number graceful graph |
| url | http://dx.doi.org/10.1080/09728600.2021.1876505 |
| work_keys_str_mv | AT kalpanamahalingam mbonaccigracefullabeling AT heldaprincyrajendran mbonaccigracefullabeling |