Header menu link for other important links
X
m-Bonacci graceful labeling
, Rajendran H.P.
Published in Taylor and Francis Ltd.
2021
Abstract
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 (Formula presented.) 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. © 2021 The Author(s). Published with license by Taylor & Francis Group, LLC.
About the journal
JournalData powered by TypesetAKCE International Journal of Graphs and Combinatorics
PublisherData powered by TypesetTaylor and Francis Ltd.
ISSN09728600
Open AccessNo