This article is available for purchase or by subscription. See below.
Abstract
|
Given a sequence we can define a directed graph using the values of the sequence as vertices
and joining consecutive vertices by arcs. The graph formed from the Lucas numbers
modulo
is proved to be properly colourable with two colours if
is
either a multiple of 5 or a Fibonacci number greater than 13.
|
PDF Access Denied
We have not been able to recognize your IP address
44.201.97.138
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 30.00:
Keywords
Lucas, Fibonacci, graph, colouring
|
Mathematical Subject Classification
Primary: 11B39
Secondary: 05C15
|
Milestones
Received: 10 September 2022
Accepted: 18 October 2022
Published: 31 October 2023
Communicated by Arthur T. Benjamin
|
© 2023 MSP (Mathematical Sciences
Publishers). |
|