Results 91 to 100 of about 2,525,419 (350)

On Lh,k-Labeling Index of Inverse Graphs Associated with Finite Cyclic Groups

Journal of Mathematics, 2021
An Lh,k-labeling of a graph G=V,E is a function f:V⟶0,∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k.
K. Mageshwaran, G. Kalaimurugan, Bussakorn Hammachukiattikul, Vediyappan Govindan, Ismail Naci Cangul   +4 more
doaj   +1 more source

CDK11 inhibition induces cytoplasmic p21WAF1 splice variant by p53 stabilisation and SF3B1 inactivation

Molecular Oncology, EarlyView.
CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir, Lukasz Arcimowicz, Lucia Martinkova, Vaclav Hrabal, Filip Zavadil Kokas, Tomas Henek, Martina Kucerikova, Ondrej Bonczek, Pavlina Zatloukalova, Lenka Hernychova, Philip J. Coates, Borivoj Vojtesek, David P. Lane   +12 more
wiley   +1 more source

Heinz Quarter Mean Labeling of Graphs

Ratio Mathematica
Mean labeling is one of the best-known labeling methods for graphs. Despite the large number of papers published on the subject of graph labeling, there are some particular formulas to be used by researchers to mean-label graphs.
Latha S, Sandhya SS
doaj   +1 more source

Novel Properties of Fuzzy Labeling Graphs

Journal of Mathematics, 2014
The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic labeling for some graphs like path, cycle, and star graph is defined. It is proved that every fuzzy magic graph is a fuzzy labeling graph, but the converse is not
A. Nagoor Gani, Muhammad Akram, D. Rajalaxmi (a) Subahashini   +2 more
doaj   +1 more source

Swapping Labeled Tokens on Graphs [PDF]

Theoretical Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamanaka, Katsuhisa, Demaine, Erik D, Ito, Takehiro, Kawahara, Jun, Kiyomi, Masashi, Okamoto, Yoshio, Saitoh, Toshiki, Suzuki, Akira, Uchizawa, Kei, Uno, Takeaki   +9 more
openaire   +6 more sources

Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA

Molecular Oncology, EarlyView.
Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson, Anders Lade Nielsen, Boe Sandahl Sorensen   +2 more
wiley   +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, Ekstein, Jan, Holub, Premysl, Togni, Olivier   +3 more
openaire   +3 more sources

Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting

Molecular Oncology, EarlyView.
CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia, Noelia Moares, Wenjie Yi‐He, Rosa Luna‐Espejo, Ricardo Fernandez‐Cisnal, Javier Ocaña‐Cuesta, Juan P. Muñoz‐Miranda, Antonio Gabucio, Cecilia M. Fernandez‐Ponce, Francisco Garcia‐Cozar   +9 more
wiley   +1 more source

Some distance magic graphs

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

α_{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