In graph - theoretic terms a homogeneous p-dendrite, p ≥ 2, is defined as a finite singly-rooted tree in which the root has valency 1 while every other vertex has valency 1 or p. More descriptively, a homogeneous p-dendrite may be imagined to start from its root as the main, or 0th order, branch which proceeds to the first - order branch point where it gives rise top first - order branches. Each of these either terminates at its other end (which is a second-order branch point) or it splits there again into p branches (which are of third order), and so on. The order of the dendrite is the highest order of a branch present in it. For completeness, a 0-th order dendrite is also allowed, this consists of the 0-th order branch alone.