标题：
Graph homomorphisms between trees
点击次数：
发表刊物：
The Electronic Journal of Combinatorics
摘要：
In this paper we study several problems concerning the number of homomorphisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization and a dual of Bollob´as and Tyomkyn's result concerning the number of walks in trees.
第一作者：
Peter Csikvari
通讯作者：
林志聪
卷号：
21 (4)
页面范围：
#P4.9
是否译文：
否
发表时间：
2014-10-01
收录刊物：
SCI
发表时间：
2014-10-01
学位：哲学博士学位
职称：教授
所在单位：高等研究院、数学与交叉科学研究中心、非线性期望前沿科学研究中心