Total graph interpretation of the numbers of the Fibonacci type (Q327721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640981 / rank
 
Normal rank
Property / zbMATH Keywords
 
edge colouring
Property / zbMATH Keywords: edge colouring / rank
 
Normal rank
Property / zbMATH Keywords
 
monochromatic paths
Property / zbMATH Keywords: monochromatic paths / rank
 
Normal rank

Revision as of 03:24, 28 June 2023

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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references