Results 91 to 100 of about 2,535,598 (350)

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

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

A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups [PDF]

, 2021
J. Pascal Gollin, Kevin Hendrey, Ken‐ichi Kawarabayashi, O‐joung Kwon, Sang‐il Oum   +4 more
openalex   +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

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

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

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