Results 81 to 90 of about 972,352 (283)
BILANGAN DOMINASI LOKASI PADA LINE PAN GRAPH DAN MIDDLE PAN GRAPH
Let G is a simple, connected, and undirected graph. A set D is a subset of V. If every node of V adjacent to at least one node D, then D is a dominating set of the graph G . One of the topics from dominating set is locating dominating set. Locating dominating set is dominating set on condition if every two vertices u,v elements of V-D satisfy the ...
Fransiskus Fran +2 more
openaire +1 more source
The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola +12 more
wiley +1 more source
Colouring set families without monochromatic k-chains
A coloured version of classic extremal problems dates back to Erd\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer is simply given
Das, Shagnik +3 more
core +1 more source
ATF4‐mediated stress response as a therapeutic vulnerability in chordoma
We screened 5 chordoma cell lines against 100+ inhibitors of epigenetic and metabolic pathways and kinases and identified halofuginone, a tRNA synthetase inhibitor. Mechanistically halofuginone induces an integrated stress response, with eIF2alpha phosphorylation, activation of ATF4 and its target genes CHOP, ASNS, INHBE leading to cell death ...
Lucia Cottone +11 more
wiley +1 more source
Grundy coloring of middle graph of wheel graph families
A Grundy k-coloring of a graph G is a proper k-coloring of vertices in G using colors {1, 2, · · · , k} such that for any two colors i and j, i < j, any vertex colored j is adjacent to some vertex colored i. The First-Fit or Grundy chromatic number (or simply Grundy number) of a graph G, denoted by ?
Maragatham, R. Stella +1 more
openaire +1 more source
Clusters in middle-phase percolation on hyperbolic plane
I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals.
Czajkowski, Jan
core +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
Total Italian Domination: Structural Results on Middle Graphs of Standard Families
If we have graph , an Italian dominating function (IDF) is defined as a mapping satisfying the condition, if for any vertex must be have neighbor there is no fewer than 1 vertex to be or no fewer than 2 vertices where The weight of a (IDF) is ...
Maryam ALTABATABAII
doaj +1 more source
Networks as a Privileged Way to Develop Mesoscopic Level Approaches in Systems Biology
The methodologies advocated in computational biology are in many cases proper system-level approaches. These methodologies are variously connected to the notion of “mesosystem” and thus on the focus on relational structures that are at the basis of ...
Alessandro Giuliani
doaj +1 more source
An update on the middle levels problem
The middle levels problem is to find a Hamilton cycle in the middle levels, M_{2k+1}, of the Hasse diagram of B_{2k+1} (the partially ordered set of subsets of a 2k+1-element set ordered by inclusion).
Savage, Carla D. +2 more
core +1 more source

