树的直径(国外英文资料).docVIP

树的直径(国外英文资料) In order to make clear the proof, first of all, the exact definition is as follows: 1. We use a ~ B to represent the unique path between any two nodes in the tree, a, B, and there are 0 or more nodes between a and B Using X, \in, a ~ B means that the node x is on the path a, B, that is, there is a path from a to X to B (here X and a or b) Coincident) A-B is represented by symbol a, and B is directly adjacent. 2. Distance between nodes - according to the nature of the tree, any two nodes u, V, there is a unique path between u ~ V connected, The number of u to V is called u, and the distance between V is denoted as D (U, V); 3. The diameter of a tree the distance between the two largest nodes in a tree is called the diameter of a tree; 4. Ancestors - let R be the root of the tree T, and u is the node of T; if x, \in, R ~ u, then x is called the ancestor of u; 5. Common ancestor - if node x is the ancestor of u and also the ancestor of V, X is the common ancestor of u and v; 6. Recent public ancestors - if x is the public ancestor of u, V, and any other common ancestor y of u, V, has d (x U, D (y) = u), then x is called u, Vs recent public ancestors. Use f (U, V) to represent the nearest public ancestor of u and V. Lemma 1: the diameter of a tree must be equal to the distance between two nodes of a leaf. Proof: trivial. Lemma 2: for the three different trees in any node a, B, C, D satisfies the triangle inequality (a, b) (a, d = C + D (C, b) ). It is proved that the nodes on a ~ C are p[1], p[2], and p[m], and the nodes on a ~ B are q[1] and q[2 respectively ],..., q[n]. Where p[1] = q[1] = a, p[m]=c, q[n]=b. If there is a case 1: K, k m and K n p[k+1] , meet q[k+1] and for all I = k, all There is p[i] = q[i]. Assume the existence of X, Y k+1 and p[x] = q[y], p[k]-p[k+1] ~ p[x] ~ q[y] and Q[k]q[k+1] A loop (as p[k]=q[k], p[k+1]q[k+1], and p[x]=q[y]) is inconsistent with the nature of the tree. So sure There is no such x, y. Therefore, there are no