On k-Distance Pell Numbers in 3-Edge-Coloured Graphs
We define in this paper new distance generalizations of the Pell numbers and the companion Pell numbers. We give a graph interpretation of these numbers with respect to a special 3-edge colouring of the graph.
Main Authors: | Krzysztof Piejko, Iwona Włoch |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/428020 |
Similar Items
-
Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
by: Krzysztof Piejko
Published: (2015-01-01) -
On Fibonacci numbers in edge coloured trees
by: Urszula Bednarz, et al.
Published: (2017-01-01) -
On Pell, Pell-Lucas, and balancing numbers
by: Gül Karadeniz Gözeri
Published: (2018-01-01) -
Fibonacci-Like sequence associated with k-Pell, k-Pell-Lucas and Modified k-Pell sequences
by: Arfat Ahmad Wani, et al.
Published: (2017-06-01) -
Some sum formulas for products of Pell and Pell-Lucas numbers
by: Hasan GÖKBA ̧S, et al.
Published: (2017-06-01)