نتایج جستجو برای: odd mean labeling

تعداد نتایج: 664567  

2015
Scott B. Crown Nicholas Marze Maciek R. Antoniewicz Gregory P Tochtrop

The branched chain amino acids (BCAA) valine, leucine and isoleucine have been implicated in a number of diseases including obesity, insulin resistance, and type 2 diabetes mellitus, although the mechanisms are still poorly understood. Adipose tissue plays an important role in BCAA homeostasis by actively metabolizing circulating BCAA. In this work, we have investigated the link between BCAA ca...

2013
A. Nagarajan A. Nellai Murugan Navaneetha Krishnan

A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG). In this paper, we proved that the graphs Pn, Cn,K2,n are near mean graphs and Kn(n > 4) and K1,n(n > 4) are not near mean graphs.

2011
M. Ibrahim Moussa

An assignment of integer numbers to the vertices of a given graph under certain conditions is referred to as a graph labeling. The assignment of labels from the set {0,1,2,...,2 1} q to the vertices of G (with ( ) G n V vertices and ( ) q E G edges) such that, when each edge has assigned a label defined by the absolute difference of its end-points, the resulting edge labels are 1,3 ,2 1 q is re...

2005
Kazuhiko NISHIJIMA K. Nishijima

Based on the charge independence hypothesis the properties of V particles are theoretically investigated. It is found that the curious behaviours of these unstable particles are most simply interpreted in terms of the 1}-charge conservation law which directly results from the C. I. hypothesis and suitable isotopic spin assignments to these particles. The topics which are discussed in this paper...

Journal: :Advances in Applied Clifford Algebras 2016

Journal: :Discrete Applied Mathematics 2010
Siham Bekkai Mekkia Kouider

We bound the mean distance in a connected graph which is not a tree in function of its order n and its girth g. On one hand, we show that mean distance is at most n+1 3 − g(g−4) 12n(n−1) if g is even and at most n+1 3 − g(g−1) 12n(n−1) if g is odd. On the other hand, we prove that mean distance is at least ng 4(n−1) unless G is an odd cycle.

Background: Definite data regarding the incidence and distribution of renal tumours in eastern India is not known. For better management, as it is essential to identify patients with poor prognosis, prognostic factors like stage, nuclear grade and their relationship to molecular markers are also unclear in this region. The purpose of our study was to assess the spectrum of adu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید