Graph Homomorphisms between Trees

Electronic Journal Of Combinatorics

Péter Csikvári¹ 

关键词: trees;    walks;    graph homomorphisms;    adjacency matrix;    extremal problems;    KC-transformation;    Markov chains;   

DOI  :  

学科分类：离散数学和组合数学

来源: 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 extre

【 授权许可】

Others