8
9. 12. 2009.
On the edge degrees of trees
Let mij (G) be the number of edges of graph G, connecting vertices of degrees i and j. Necessary and sufficient conditions are established on a symmetric matrix M of type ∆ ×∆ such that there is a tree T for which Mij = mij (T ) holds for all i, j.