Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
We determine the smallest and the largest number of (A,B,2C)-edge colourings in trees. We prove that the star is a unique tree that maximizes the number of all of the (A,B,2C)-edge colourings and that the path is a unique tree that minimizes it.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2015/463650 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|