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

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

2015
Sathish Narayanan

A graph G = (V,E) with p vertices and q edges is said to be a Total Mean Cordial graph if there exists a function f : V (G) → {0, 1, 2} such that for each edge xy assign the label ⌈ f(x)+f(y) 2 ⌉ where x, y ∈ V (G), and the total number of 0, 1 and 2 are balanced. That is |evf (i)− evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0,...

2013
David Raj

In this paper, we introduce a new labeling called one modulo three harmonic mean labeling. A graph G is said to be one modulo three harmonic mean graph if there is a function φ from the vertex set of G to {1, 3, 4, ... ,3 − 2, 3 } with φ is one-one and φ induces a bijection φ∗ from the edge set of G to {1, 4, ..., 3q 2}, where φ∗(e = uv) = ( ) ( ) ( ) ( ) or ( ) ( ) ( ) ( ) and the function φ i...

Journal: :transactions on combinatorics 2013
p.siva kota reddy u. k. misra

let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...

Journal: :journal of algorithms and computation 0
sarah minion department of mathematics, clayton state university, morrow, georgia 30260, usa christian barrientos department of mathematics, clayton state university, morrow, georgia 30260, usa

a graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ e(g)} consists of n integers. inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of g and k2 , and the disjoint :union: of g...

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 1999

Journal: :iranian journal of pathology 2015
sabuj ghana mukhopadhyay krishnendu mukherjee asim kr. manna

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 adult renal tumours w...

2010
Takahiro Kuchimaru Tetsuya Kadonosono Shotaro Tanaka Takashi Ushiki Masahiro Hiraoka Shinae Kizaka-Kondoh

Hypoxia-inducible factor (HIF) functions as a master transcriptional regulator for adaptation to hypoxia by inducing adaptive changes in gene expression for regulation of proliferation, angiogenesis, apoptosis and energy metabolism. Cancers with high expression of the alpha subunit of HIF (HIFα) are often malignant and treatment-resistant. Therefore, the development of a molecular probe that ca...

Journal: :Physical review. C, Nuclear physics 1995
Dobaczewski Dudek

Rotation-induced time-odd components in the nuclear mean field are analyzed using the Hartree-Fock cranking approach with effective interactions SIII, SkM*, and SkP. Identical dynamical moments J (2) are obtained for pairs of superdeformed bands 151 Tb(2)– 152 Dy(1) and 150 Gd(2)– 151 Tb(1). The corresponding relative alignments strongly depend on which time-odd mean-field terms are taken into ...

2008
T. Duguet P. Bonche P. - H. Heenen J. Meyer

Part 1: description of odd nuclei in mean-field theories. Abstract In order to extract informations on pairing correlations in nu-clei from experimental mass differences, the different contributions to odd-even mass differences are investigated within the Skyrme HFB 1 method. In this first paper, the description of odd nuclei within HFB is discussed since it is the key point for the understandi...

Journal: :Archive of Formal Proofs 2011
Christine Rizkallah

A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching. An odd-set cover OSC of a graph G is a labeling of the nodes of G with integers such that every edge of G is either incident to a node labeled 1 or connects two nodes labeled with the same number i ≥...

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

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