Homomorphisms of Trees into a Path
Let hom(G,H) denote the number of homomorphisms from a graph G to a graph H. In this paper we study the number of homomorphisms of trees into a path, and prove that hom(P[subscript m],P[subscript n]) ≤ hom(T[subscript m],P[subscript n]) ≤ hom(S[subscript m],P[subscript n]), where T[subscript m] is a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2015-12-28T23:48:23Z.
|
| Subjects: | |
| Online Access: | Get fulltext |