Translator Disclaimer
2015 Extremal Trees with respect to Number of ( A , B , 2 C ) -Edge Colourings
Krzysztof Piejko
J. Appl. Math. 2015: 1-5 (2015). DOI: 10.1155/2015/463650

Abstract

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.

Citation

Download Citation

Krzysztof Piejko. "Extremal Trees with respect to Number of ( A , B , 2 C ) -Edge Colourings." J. Appl. Math. 2015 1 - 5, 2015. https://doi.org/10.1155/2015/463650

Information

Published: 2015
First available in Project Euclid: 28 January 2016

zbMATH: 1347.05033
MathSciNet: MR3437310
Digital Object Identifier: 10.1155/2015/463650

Rights: Copyright © 2015 Hindawi

JOURNAL ARTICLE
5 PAGES


SHARE
Vol.2015 • 2015
Back to Top