For any h ∈ Z, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh−{0} such that the induced vertex set labeling l : V (G) → Zh defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. For a given graph G, the set of all h ∈ Z+ for which G is h-magic is called the integermagic spectrum of G and is denoted by IM (G). In this paper, we will determine the integer-magic sp...

quercus persica and pistacia mutica are two known and prevalent forest trees of baneh and marivan from kurdistan province (w iran). thirty-five fungal isolates were obtained from 50 bark samples of q. persica collected in sept. and mar. 2010–11. the aim of this study was to identify fungi associated with oak trees of kurdistan province. based on morphological features and authentic keys (ellis ...

Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest intercon-nection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for any input terminal set. On a workstation, problems involving 20 input terminals can be solved in a few seconds, and problems involving 30 input termi...

of field-grown hinoki cypress (Chamaecyparis obtusa (Sieb. et Zucc.) Endl.) was nondestructively measured at monthly intervals over 1 year with an enclosed standing tree method. The relationship between monthly specific respiration rate and monthly mean relative growth rate at the individual tree level was described by a linear equation. During the dormant season, respiration was used mainly fo...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...