A Proof of Three-path Trees P(m,n,t) Being Edge-magic(II)
LU Yong-jie · College Mathematies · 2004
Let G be a graph with p vertices and q edges. Assume the vertices and edges of G are labeled by 1,2,…,(p+q) such that each label is used exactly once. We define the valence of an edge to be the sum of the label of e plus the two labels of the vertices incident with e. If a labeling of G is possible such that the valence for e is constant, we call the graph G is edge-magic. In this paper, we proof three-path tree P(m,n,t) is edge-magic when n is oven t=n+2.