Results 91 to 100 of about 285,444 (268)
Discrete Mathematics, 1986 It is known that the cycle space of a planar graph G is generated by boundaries of faces of an embedding of G in the plane. The author generalizes this to arbitrary cell complexes with the trivial first homology group.
openaire +1 more source
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics, 1998 The cube-connected cycles graph, denoted \(\text{CCC}_n\), is the graph of order \(n2^n\) whose vertices are labeled \((\ell, x)\), where \(\ell\) is an integer between 0 and \(n-1\) which is called the level of the vertex, and \(x\) is a binary string of length \(n\) called the row of \(x\). Vertices \((\ell, x)\) and \((\ell', y)\) are adjacent in \(\
Anne Germa +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Cycles in cube-connected cycles graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lih-Hsing Hsu +3 more
openaire +1 more source
Molecular Oncology, EarlyView.Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena +15 more
wiley +1 more source
Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph
Mathematics, 2018 A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with
Juan L. G. Guirao +3 more
doaj +1 more source
On Center Cycles in Grid Graphs
Annals of Operations Research, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Foulds, Les R. +3 more
openaire +3 more sources
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
Social Structure Decomposition With Security Issue
IEEE Access, 2019 Social structure decomposition has been a valuable research topic in the study of social networks, and it still has many unresolved problems. At the same time, an increasing number of people pays attention to the security issue that is worth considering ...
Wenshun Teng +3 more
doaj +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source