Total graph interpretation of the numbers of the Fibonacci type (Q327721): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2015/837917 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138590243 / rank | |||
Normal rank | |||
Revision as of 01:28, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total graph interpretation of the numbers of the Fibonacci type |
scientific article |
Statements
Total graph interpretation of the numbers of the Fibonacci type (English)
0 references
19 October 2016
0 references
Summary: We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all \((A_1, 2 A_1)\)-edge colourings in trees.
0 references
edge colouring
0 references
monochromatic paths
0 references
