Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Helda Princy Rajendran"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021)
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 t
Externí odkaz:
https://doaj.org/article/499bfee6ac5f40a1a537d7216e383090
Publikováno v:
Discrete Applied Mathematics. 319:149-158
We introduce the notion of m -bonacci-sum graphs denoted by G m , n for positive integers m , n . The vertices of G m , n are 1 , 2 , … , n and any two vertices are adjacent if and only if their sum is an m -bonacci number. We show that G m , n is
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021)
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 t
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030115081
CALDAM
CALDAM
We introduce the notion of m-bonacci-sum graphs denoted by \(G_{m,n}\) for positive integers m, n. The vertices of \(G_{m,n}\) are \(1,2,\ldots ,n\) and any two vertices are adjacent if and only if their sum is an m-bonacci number. We show that \(G_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::deac5aa1641c0fd195b9c819161e7729
https://doi.org/10.1007/978-3-030-11509-8_6
https://doi.org/10.1007/978-3-030-11509-8_6