Results 41 to 50 of about 8,416,430 (349)
Objective To investigate the effects of long non-coding RNA DUXAP8 on the proliferation, cell cycle and apoptosis of ovarian cancer cells by regulating miR-4677-3p. Methods The expression of DUXAP8 and miR-4677-3p in ovarian cancer tissues and cell lines
CHEN Cen +4 more
doaj +1 more source
81 pages, 47 figures, 5 tables, Submitted Oct.
openaire +8 more sources
New classes of reverse super edge magic graphs
A reverse edge magic (REM) labeling of a graph $ G(V, E) $ with $ p $ vertices and $ q $ edges is a bijection $ f:V\left(G \right)\cup E\left(G \right)\to \{1, 2, \cdot \cdot \cdot, p+q\} $ such that $ k = f\left(uv \right)-\{f\left(u \right)+f\left(v ...
Kotte Amaranadha Reddy, S Sharief Basha
doaj +1 more source
Few cycle pulse propagation [PDF]
We present a comprehensive framework for treating the nonlinear interaction of few-cycle pulses using an envelope description that goes beyond the traditional SVEA method.
A. Baltuska +12 more
core +2 more sources
Background: Porcine embryonic development is widely utilized in the medical industry. However, the blastocyst development rate in vitro is lower compared to in vivo. To address this issue, various supplements are employed.
Heejae Kang +6 more
doaj +1 more source
The Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle
For given graphs G1,G2,…,Gn and any integer j, the size of the multipartite Ramsey number mj(G1,G2,…,Gn) is the smallest positive integer t such that any n-coloring of the edges of Kj×t contains a monochromatic copy of Gi in color i for some i, 1≤i≤n ...
Yaser Rowshan +2 more
doaj +1 more source
Forbidden Pairs and (k,m)-Pancyclicity
A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj +1 more source
The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim
Zongpeng Ding, Xiaomei Qian
doaj +1 more source
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), and k(p + q) = 2mn for
Jeevadoss Shanmugasundaram +1 more
doaj +1 more source
Solar cycle 25: another moderate cycle?
Surface flux transport simulations for the descending phase of cycle 24 using random sources (emerging bipolar magnetic regions) with empirically determined scatter of their properties provide a prediction of the axial dipole moment during the upcoming ...
Cameron, Robert H. +2 more
core +1 more source

