In the present paper, we introduce classical mean labeling of graphs and investigate their related properties. Moreover, it is obtained that line graph operation preserves meanness property for some standard graphs.

background: bombesin shows high affinity for gastrin-releasing peptide (grp) receptors which over expressed on the cell surfaces of several human tumors particularly in prostate and breast cancers. the aim of this study was labeling of designed analogue with99mtc via hynic and tricine /edda and evaluation as potential targeted tumor scintigraphic agent.materials and methods: hynic-bombesin was ...

Short-term energy load forecasting, such as hourly predictions for the next n (n ≥ 2) hours, will benefit from exploiting the relationships among the n estimated outputs. This paper treats such multisteps ahead regression task as a sequence labeling (regression) problem, and adopts a Continuous Conditional Random Fields (CCRF) strategy. This discriminative approach intuitively integrates two la...

A radio mean labeling of a connected graph G is a one to one map f from the vertex set V (G) to the set of natural numbers N such that for each distinct vertices u and v of G, d (u, v)+ ⌈ f(u)+f(v) 2 ⌉ ≥ 1+ diam (G). The radio mean number of f , rmn (f), is the maximum number assigned to any vertex of G.The radio mean number of G, rmn (G) is the minimum value of rmn (f) taken over all radio mea...

A Radio Heronian Mean Dd-distance Labeling of a connected graph is an injective map from the vertex set N such that for two distinct vertices and , Dd where denotes between Dd-diameter G.

We present a new model-based approach for an automated labeling and segmentation of the rib cage in chest CT scans. A mean rib cage model including a complete vertebral column is created out of 29 data sets. We developed a ray search based procedure for rib cage detection and initial model pose. After positioning the model, it was adapted to 18 unseen CT data. In 16 out of 18 data sets, detecti...

Let G be a (p, q) graph and let f : V (G) → {1, 2, 3, · · · , p + q} be an injection. For each edge e = uv, let f∗(e) = (f(u)+f(v))/2 if f(u)+f(v) is even and f∗(e) = (f(u)+f(v)+1)/2 if f(u) + f(v) is odd. Then f is called a super mean labeling if f(V ) ∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, · · · , p+ q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we presen...

background: chlorotoxin is a 36-amino acid peptide found in the venom of the leiurus quinquestriatus which blocks small-conductance chloride channels. chlorotoxin binds preferentially to glioma cells that allow development of new methods for the treatment and diagnosis of several types of cancer. thus chlorotoxin derivative was labeled with 131i for further investigation. materials and methods:...

Let G(V, E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, . . . , q}, consider an induced edge labeling f ∗ : E(G) → {1, 2, . . . , q} defined by f ∗(uv) = { f(u)+f(v) 2 if f(u) and f(v) are of the same parity, f(u)+f(v)+1 2 otherwise for every edge uv ∈ E(G). If f ∗(E) = {1, 2, . . . , q}, then we say that f is a mean labeling of G. If a graph G admits a me...