Results 61 to 70 of about 100,347 (247)
Swapping Labeled Tokens on Graphs [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamanaka, Katsuhisa +9 more
openaire +6 more sources
ATF4‐mediated stress response as a therapeutic vulnerability in chordoma
Molecular Oncology, EarlyView.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
α_{2}-labeling of graphs [PDF]
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\)
Dalibor Fronček
doaj +1 more source
Radio labelings of distance graphs [PDF]
Discrete Applied Mathematics, 2013 A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| \geq k+1 - d(x,y),$$ for any two vertices $x$ and $y$, $x\ne y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio labelings of distance graphs, i.e., graphs with the set $\Z$
Čada, Roman +3 more
openaire +3 more sources
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
Molecular Oncology, EarlyView.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
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj +2 more sources
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Shotgun Assembly of Labeled Graphs
IEEE Transactions on Network Science and Engineering, 2019 Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Mossel, E, Ross, N
openaire +3 more sources
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Labeling angles of planar graphs
Discrete Mathematics, 1988 By a well-known theorem of Heawood, 3-edge-coloring bridgeless planar cubic graphs is equivalent to labeling vertices with \(+1\) or -1 so that the sum around any face is 0(mod 3). The authors introduce the notion of ``angle-labeling'' and prove results analogous to Heawood's for bridgeless planar graphs with vertices of degree 2 or 3; the angles and ...
Loupekine, Feodor, Watkins, John J.
openaire +1 more source