Results 41 to 50 of about 285,444 (268)
Cycle permutation graphs C(n,\(\alpha)\) are those permutation graphs where the underlying graph is a cycle with n vertices of which \(\alpha\) is a permutation. For some special types of cycle permutation graphs arising from certain kinds of permutations \(\alpha\) the crossing numbers are determined.
openaire +1 more source
AbstractLet G be a 3‐connected simple graph of minimum degree 4 on at least six vertices. The author proves the existence of an even cycle C in G such that G‐V(C) is connected and G‐E(C) is 2‐connected. The result is related to previous results of Jackson, and Thomassen and Toft.
openaire +2 more sources
On embedding a cycle in a plane graph [PDF]
The problem of drawing a non-simple cycle as a non-intersecting closed curve into a planar graph drawn in the plane with the vertices represented as circles and the edges represented as thin stripes is considered. The problem is shown to have an interpretation in the \textit{clustered planarity}.
Pier Francesco Cortese +3 more
openaire +4 more sources
This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley +1 more source
Decomposing certain equipartite graphs into sunlet graphs of length 2p
For any integer r≥3, we define the sunlet graph of order 2r, denoted L2r, as the graph consisting of a cycle of length r together with r pendant vertices, each adjacent to exactly one vertex of the cycle.
Abolape D. Akwu +1 more
doaj +1 more source
The paper considers random graphs \(G(n,p)\) with \(n\) vertices in which each possible edge is presented independently with probability \(p=p(n)\). The paper shows that, asymptotically, such graphs are very nearly pancyclic. More precisely it is shown that, if \(\varepsilon>0\) and \(np(n)\to\infty\), then the probability that \(G(n,p)\) contains ...
openaire +2 more sources
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon +13 more
wiley +1 more source
A graph \(G\) is called \(K\)-connected, \(K\) a fixed collection of graphs, if every pair of edges of \(G\) is contained in a subgraph \(S\) of \(G\), where \(S\in K\). The authors discuss \(C_4\)-connected graphs, where \(C_4\) is a cycle of length four and compute the constant \(c''\) such that there exists a graph with \(cn^2\) edges \((n = |V(G)|)\
Richard A. Duke +2 more
openaire +1 more source
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla +10 more
wiley +1 more source

