Results 111 to 120 of about 272,972 (308)

Forbidden subgraphs of TI-power graphs of finite groups

Open Mathematics
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj   +1 more source

Automorphism group of certain power graphs of finite groups

Electronic Journal of Graph Theory and Applications, 2017
The power graph $\mathcal{P}(G)$ of a group $G$ is the graphwith group elements as vertex set and two elements areadjacent if one is a power of the other. The aim of this paper is to compute the automorphism group of the power graph of several well-known
Ali Reza Ashrafi, Ahmad Gholami, Zeinab Mehranian   +2 more
doaj   +1 more source

MiR‐513a promotes human erythroid differentiation by modulating c‐Jun

FEBS Open Bio, EarlyView.
During early human erythropoiesis, miR‐513a promoted erythroid differentiation in primary human CD34+ hematopoietic stem‐progenitor cells and human TF‐1 erythroleukemic cells by indirectly decreasing c‐Jun and phospho‐c‐Jun expression, which are associated with increased GATA1 expression.
MinJung Kim, Brittany Taylor, Shannon Bolten, Christian L. Eberly, Mahliya Abdurahman, T. Michael Creed, Acong Yang, Taylor L. Hatchet, Tristan Dyson, Shuo Gu, Curt I. Civin, Tami J. Kingsbury   +11 more
wiley   +1 more source

Identifying gene expression signatures for risk stratification of postoperative adjuvant chemotherapy in colorectal cancer

FEBS Open Bio, EarlyView.
A novel signature integrating genome‐wide analysis with clinical factors predicts recurrence in stage II colorectal cancer and enables a new risk stratification to guide postoperative adjuvant chemotherapy. Clinical risk stratification for postoperative recurrence in patients with pathological stage II (pStage II) colorectal cancer (CRC) is essential ...
Mayuko Otomo, Keisuke Okuno, Shuichi Watanabe, Sakiko Oba, Hiroyasu Kagawa, Masanori Tokunaga, Daisuke Ban, Yusuke Kinugasa   +7 more
wiley   +1 more source

A stochastic model for the evolution of the web allowing link deletion [PDF]

, 2005
Recently several authors have proposed stochastic evolutionary models for the growth of the web graph and other networks that give rise to power-law distributions.
Mark Levene, Levene, Mark, Trevor Fenner, George Loizou, Fenner, Trevor, Loizou, George   +5 more
core   +1 more source

Efficient State Estimation Through Rapid Topological Analysis Based on Spatiotemporal Graph Methodology

IEEE Open Access Journal of Power and Energy
The seamless integration of swift and precise topological analysis with state estimation is crucial for ensuring the dependability, stability, and efficiency of the power system.
Zhen Dai, Shouyu Liang, Yachen Tang, Jun Tan, Guangyi Liu, Qinyu Feng, Xuanang Li   +6 more
doaj   +1 more source

Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens

FEBS Open Bio, EarlyView.
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee, Giulia Zanetti, Bram van den Broek, Kees Jalink   +3 more
wiley   +1 more source

Bonneville Power Administration Budget for Fiscal Year 1993.

, 1992
This report contains the FY 1993 Congressional budget for the Bonneville Power Administration. The overview includes tables and summary statements of (1) Current services -- Program and financing; (2) Status of borrowing and cash flow; (3) Impact of ...
United States. Bonneville Power Administration.
core   +1 more source

The extreme vertices of the power graph of a group. [PDF]

Heliyon, 2022
AbuGhneim OA, Abudayah M.
europepmc   +1 more source

The Shannon Capacity of Graph Powers

IEEE Transactions on Information Theory
For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods.
Aida Abiad, Cristina Dalfó, Miguel Angel Fiol   +2 more
openaire   +3 more sources