|
|
|
|
Extremal Trees with respect to Number of (A,B,2C) -Edge Colourings
|
|
|
|
|
|
|
|
نویسنده
|
piejko k.
|
|
منبع
|
journal of applied mathematics - 2015 - دوره : 2015 - شماره : 0
|
|
چکیده
|
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. © 2015 krzysztof piejko.
|
|
|
|
|
آدرس
|
faculty of mathematics and applied physics,rzeszów university of technology,aleja powstańców warszawy 12, Poland
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|