Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings
Author
Source
Journal of Applied Mathematics
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-12-14
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Piejko, Krzysztof. 2015. Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings. Journal of Applied Mathematics،Vol. 2015, no. 2015, pp.1-5.
https://search.emarefa.net/detail/BIM-1067092
Modern Language Association (MLA)
Piejko, Krzysztof. Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings. Journal of Applied Mathematics No. 2015 (2015), pp.1-5.
https://search.emarefa.net/detail/BIM-1067092
American Medical Association (AMA)
Piejko, Krzysztof. Extremal Trees with respect to Number of (A,B,2C)-Edge Colourings. Journal of Applied Mathematics. 2015. Vol. 2015, no. 2015, pp.1-5.
https://search.emarefa.net/detail/BIM-1067092
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1067092
