z-logo
open-access-imgOpen Access
On Fibonacci numbers in edge coloured trees
Author(s) -
Urszula Bednarz,
Dorota Bród,
Anetta SzynalLiana,
Iwona Włoch,
Małgorzata Wołowiec-Musiał
Publication year - 2017
Publication title -
opuscula mathematica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.481
H-Index - 16
eISSN - 2300-6919
pISSN - 1232-9274
DOI - 10.7494/opmath.2017.37.4.479
Subject(s) - fibonacci number , mathematics , combinatorics , enhanced data rates for gsm evolution , tree (set theory) , pisano period , fibonacci polynomials , artificial intelligence , computer science , orthogonal polynomials , difference polynomials
In this paper we show the applications of the Fibonacci numbers in edge coloured trees. We determine the second smallest number of all \((A,2B)\)-edge colourings in trees. We characterize the minimum tree achieving this second smallest value

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom