Results 71 to 80 of about 2,535,598 (350)
Electronic Notes in Discrete Mathematics, 2017 This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
openaire +3 more sources
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
1-Relaxed Edge-Sum Labeling Game [PDF]
, 2015 We introduce a new graph labeling and derive a game on graphs called the 1-relaxed modular edge-sum labeling game. Given a graph G and a natural number n, we define a labeling by assigning to each edge a number from {1,..., n} and assign a corresponding ...
Do, Hang, Moran, Brent, Singer, Timothy
core +1 more source
PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS
BarekengLet be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one ...
R Ponraj, S Prabhu
doaj +1 more source
On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, 2020 A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv.
I. H. Agustin +4 more
doaj +1 more source
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Succinct Representation of Labeled Graphs [PDF]
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbay, Jérémy +3 more
openaire +4 more sources
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Radio Graceful Labelling of Graphs
Theory and Applications of Graphs, 2020 Summary: Radio labelling problem of graphs have their roots in communication problem known as Channel Assignment Problem. For a simple connected graph \(G=(V(G),E(G))\), a radio labeling is a mapping \(f:V(G)\to \{0,1,2,\dots\}\) such that \(|f(u)-f(v)|\ge\text{diam}(G)+1-d(u,v)\) for each pair of distinct vertices \(u,v\in V(G)\), where \(\text{diam ...
Saha, Laxman, Basunia, Alamgir Rahaman
openaire +5 more sources
Minimal Sum Labeling of Graphs [PDF]
Journal of Discrete Algorithms, 2018 A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex $w\in V(G)$ such that $\ell(u)+\ell(v) = \ell(w)$. We say that sum labeling $\ell$ is minimal if there is a vertex
Matěj Konečný +5 more
openaire +3 more sources