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:
Bibliographic Details
Main Author: Krzysztof Piejko
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!
_version_ 1832554680324980736
author Krzysztof Piejko
author_facet Krzysztof Piejko
author_sort Krzysztof Piejko
collection DOAJ
description 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.
format Article
id doaj-art-946182c5140d42579410c9a64135e09e
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2015-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-946182c5140d42579410c9a64135e09e2025-02-03T05:50:51ZengWileyJournal of Applied Mathematics1110-757X1687-00422015-01-01201510.1155/2015/463650463650Extremal Trees with respect to Number of (A,B,2C)-Edge ColouringsKrzysztof Piejko0Faculty of Mathematics and Applied Physics, Rzeszów University of Technology, Aleja Powstańców Warszawy 12, 35-959 Rzeszów, PolandWe 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.http://dx.doi.org/10.1155/2015/463650
spellingShingle Krzysztof Piejko
Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
Journal of Applied Mathematics
title Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
title_full Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
title_fullStr Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
title_full_unstemmed Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
title_short Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
title_sort extremal trees with respect to number of a b 2c edge colourings
url http://dx.doi.org/10.1155/2015/463650
work_keys_str_mv AT krzysztofpiejko extremaltreeswithrespecttonumberofab2cedgecolourings