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.
Saved in:
Main Authors: | Krzysztof Piejko, Iwona Włoch |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/428020 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
by: Krzysztof Piejko
Published: (2015-01-01) -
Gaussian-bihyperbolic Numbers Containing Pell and Pell-Lucas Numbers
by: Hasan Gökbaş
Published: (2023-03-01) -
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website
by: Rupkumar Mahapatra, et al.
Published: (2022-01-01) -
The number of edges on generalizations of Paley graphs
by: Lawrence Sze
Published: (2001-01-01) -
Factoring with Pell conics
by: Rasa Šleževičienė
Published: (2004-12-01)