نتایج جستجو برای: 2q duplication

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

1998
Radwan Al-Farawati M. G. van den Berg

The conditional stability constants of metal–sulfide complexes were determined in pH 8 seawater at various salinities, by Ž . flow-analysis with detection by cathodic stripping voltammetry FA-CSV . Two methods were used. The first method was titration of the sulfide by metal with detection of the free sulfide by FA-CSV. The titrant metals were Ag, Cd, Co, 2q 2q 2q 2q 3q 3q Ž . Fe , Mn , Pb , Zn...

1999
Cristina M. Sena Rosa M. Santos Michael R. Boarder Luıs M. Rosario

Phorbol esters reduce depolarization-evoked Ca influx in adrenal chromaffin cells, suggesting that voltage-sensitive Ca channels Ž . 2q VSCCs are inhibited by protein kinase C-mediated phosphorylation. We now address the possibility that Land PrQ-type Ca channel Ž . subtypes might be differentially involved in phorbol ester action. In bovine chromaffin cells, short-term 10 min incubations with ...

1997
Yves Edel

We construct (2q+q+9)-caps in projective 4-space PG(4, q) in characteristic two for every q > 4.

2012
AYESHA RIASAT SALMA KANWAL SANA JAVED Abdus Salam

Let G = (V, E) be a finite, simple and undirected graph having v = |V (G)| and e = |E(G)|. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q−1} such that, when each edge xy is assigned the label |f(x)−f(y)|, the resulting edge labels are {1, 3, 5, . . . , 2q−1}. Motivated by the work of Z. Gao [6], we have defined odd graceful labeling f...

Journal: :Discrete Applied Mathematics 1995
Felix Lazebnik Vasiliy A. Ustimenko

Let k ≥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a q–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5. The constructed graph is the incidence graph of a flag–transitive semiplane. For any positive integer t we also give an example of a q = 2–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5 which is b...

2017
P. Jeyanthi

A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function f∗ : E(G) → {1, 3, · · · , 2q − 1} defined by f∗(uv) = f(u) + f(v) is a bijection. In this paper we prove that the plus graph Pln , open star of plus graph S(t.P ln), path union of plus graph Pln, joining of Cm and plus graph Pln with a path, one point u...

Journal: :Electr. J. Comb. 2010
Hossein Hajiabolhassan Ali Taherkhani

In this paper we investigate some basic properties of fractional powers. In this regard, we show that for any rational number 1 ≤ 2r+1 2s+1 < og(G), G 2r+1 2s+1 −→ H if and only if G −→ H− 2s+1 2r+1 . Also, for two rational numbers 2r+1 2s+1 < 2p+1 2q+1 and a non-bipartite graph G, we show that G 2r+1 2s+1 < G 2p+1 2q+1 . In the sequel, we introduce an equivalent definition for circular chromat...

Journal: :journal of algorithms and computation 0
r. vasuki department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india s. suganthi department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india g. pooranam department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india

let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...

1998
G. L. Ebert

This paper is concerned with constructing caps embedded in line Grassman-nians. In particular, we construct a cap of size q 3 + 2q 2 + 1 embedded in the Klein quadric of P G(5; q) for even q, and show that any cap maximally embedded in the Klein quadric which is larger than this one must have size equal to the theoretical upper bound, namely q 3 + 2q 2 + q + 2. It is not known if caps achieving...

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

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