Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (Q327737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Revision as of 04:54, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings |
scientific article |
Statements
Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (English)
0 references
19 October 2016
0 references
Summary: We determine the smallest and the largest number of \((A, B, 2 C)\)-edge colourings in trees. We prove that the star is a unique tree that maximizes the number of all of the \((A, B, 2 C)\)-edge colourings and that the path is a unique tree that minimizes it.
0 references
Fibonacci numbers in graphs
0 references
