Extremal Trees with respect to Number of (A, B, 2C)‐Edge Colourings

Krzysztof Piejko

Journal of Applied Mathematics, 2015, vol. 2015, issue 1

Abstract: 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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2015/463650

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2015:y:2015:i:1:n:463650

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().