Results 81 to 90 of about 2,666,039 (345)
The orthogonality relation among subspaces of a finite vector space is studied here by means of the corresponding graph. In the case we consider, this graph has some highly symmetric induced subgraphs. We find three infinite families of graphs of girth 3, and two infinite families of graphs of girth 5, whose automorphism groups are transitive on ...
openaire +3 more sources
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani +14 more
wiley +1 more source
THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph.
Meilin I. Tilukay, Venn Y. I. Ilwaru
doaj +1 more source
L-Visibility Drawings of IC-planar Graphs
An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is an L-shape, and every edge is either a horizontal ...
AM Dean +6 more
core +1 more source
Comprehensive analysis of genomic mutations, gene expression, DNA methylation, and pathway analysis of TCGA data was carried out to define cancer types in which proteasome subunits expression is associated with worse survival. Albeit the effect of specific proteasome subunits on cellular function, the main role of the proteasome is better evaluated ...
Ruba Al‐Abdulla +5 more
wiley +1 more source
Facial Rainbow Coloring of Plane Graphs
A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
On the Laplacian spectral radii of Halin graphs
Let T be a tree with at least four vertices, none of which has degree 2, embedded in the plane. A Halin graph is a plane graph constructed by connecting the leaves of T into a cycle. Thus the cycle C forms the outer face of the Halin graph, with the tree
Huicai Jia, Jie Xue
doaj +1 more source
Thermodynamic limit of Nekrasov partition function for 5-brane web with O5-plane
In this paper, we study 5d N $$ \mathcal{N} $$ = 1 Sp(N) gauge theory with N f (≤ 2N + 3) flavors based on 5-brane web diagram with O5-plane. On the one hand, we discuss Seiberg-Witten curve based on the dual graph of the 5-brane web with O5-plane.
Xiaobin Li, Futoshi Yagi
doaj +1 more source
Connectivity of Triangulation Flip Graphs in the Plane
AbstractGiven a finite point setPingeneral positionin the plane, afull triangulationofPis a maximal straight-line embedded plane graph on P. Apartial triangulationofPis a full triangulation of some subset$$P'$$P′ofPcontaining all extreme points in P. Abistellar flipon a partial triangulation either flips an edge (callededge flip), removes a non-extreme
Wagner, Uli, Welzl, Emo
openaire +4 more sources
The pan‐HDAC inhibitor belinostat increases the expression of the pro‐apoptotic proteins Bim, Puma, and Noxa and induces apoptosis in ovarian cancer cell lines and patient‐derived tumor organoids when used at high concentrations. Moreover, inhibiting the anti‐apoptotic proteins Bcl‐xL or Mcl‐1 sensitizes these preclinical models to the cytotoxic effect
Cécilia Thomine +10 more
wiley +1 more source

