In mammalian cells, transcription is globally silenced during mitosis owing to the highly-condensed chromatin. Immediately after mitosis, daughter cells restart the transcription of early G1 genes along the program which is transmitted from parental cells. Although several mechanisms (such as “mitotic gene bookmarking”) have been postulated, the detailed mechanism of transcription of early G1 g...

Cyclin G1 is the only cyclin that has either positive or negative effects on cell growth. Our previous study found decreased expression of cyclin G1 in human endometrial carcinoma tissues compared with normal endometrial tissues. The study aimed to evaluate cyclin G1 expression and its effect on proliferation of human endometrial carcinoma cells (ECCs). Cyclin G1-GFP (green fluorescence protein...

Let G1 and G2 be graphs on n vertices. If there are edge-disjoint copies of G1 and G2 in Kn, then we say there is a packing of G1 and G2. A conjecture of Bollob as and Eldridge [5] asserts that, if ( (G1) + 1)( (G2) + 1) n+ 1 then there is a packing of G1 and G2. We prove this conjecture when (G1) = 3, for su ciently large n.

In this paper, informational (Shannon) measures of symmetry are introduced and analyzed for patterns built 1D 2D shapes. The measure Hsym(G) characterizes the averaged uncertainty in presence elements from group G a given pattern, whereas Shannon-like Ωsym(G) quantifies appearance shapes possessing total n belonging to pattern. Hsym(G1)=Ωsym(G1)=0 irregular, non-symmetric shapes, where G1 is id...

Let G1 and G2 be two graphs on disjoint sets of n1 and n2 vertices, respectively. The corona of graphs G1 and G2, denoted by G1 ◦ G2, is the graph formed from one copy of G1 and n1 copies of G2 where the i-th vertex of G1 is adjacent to every vertex in the i-th copy of G2. The neighborhood corona of G1 and G2, denoted by G1 ⋄ G2, is the graph obtained by taking one copy of G1 and n1 copies of G...

Let G = (V,E) be a simple undirected graph. The neighborhood hypergraph N (G) = (V, EN ) of G has the edge set EN = {e ⊆ V | |e| ≥ 1 ∧ ∃x ∈ V : e = NG(x)}. In a certain sense, this is a generalization of the well-known notion of the neighborhood graph N(G) = (V,EN ). For several products G1 ◦G2 of simple undirected graphs G1 and G2, we investigate the question how N(G1 ◦G2) / N (G1 ◦G2) can be ...

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if (G1) (G2) < 0.5n, then G1 and G2 pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u)+ d(v) : uv ∈ E(G)}. We show that if θ(G1) (G2) < n, then G1 and G2 pack. ...