Results 71 to 80 of about 2,304,207 (332)

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ý, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Štěpán Šimsa, Martin Töpfer   +5 more
openaire   +3 more sources

On Square Sum Labeling of Two Families of Petersen Graphs

Journal of Mathematics, 2022
A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f:VG⟶0,1,2,3,…,n−1 such that the function f∗:EG⟶N defined by f∗st=fs2+ft2, for all st∈EG, is injective.
Zhiqiang Zhang, Muhammad Naeem, Abeera Tariq, Weidong Zhao   +3 more
doaj   +1 more source

Note on edge irregular reflexive labelings of graphs

AKCE International Journal of Graphs and Combinatorics, 2019
For a graph , an edge labeling and a vertex labeling are called total -labeling, where . The total -labeling is called an edge irregular reflexive -labeling of the graph , if for every two different edges and of , one has The minimum for which the graph ...
Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna   +4 more
doaj   +1 more source

From omics to AI—mapping the pathogenic pathways in type 2 diabetes

FEBS Letters, EarlyView.
Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan, Lu Qi, Pierre Zalloua   +2 more
wiley   +1 more source

PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS

Barekeng
Let  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, M. I. Utoyo, Dafik, M. Venkatachalam, Surahmat   +4 more
doaj   +1 more source

On labeled graph $C^*$-algebras

Rocky Mountain Journal of Mathematics, 2020
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
Banjade, Debendra P., Ephrem, Menassie
openaire   +4 more sources

Ergothioneine supplementation improves pup phenotype and survival in a murine model of spinal muscular atrophy

FEBS Letters, EarlyView.
Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile, Daniela Ratto, Giorgia Rastelli, Ottavia Eleonora Ferraro, Caterina Temporini, Sunil Kumar, Simona Boncompagni, Paola Rossi, Monica Canepari   +8 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 ...
Feodor Loupekine, John J. Watkins
openaire   +2 more sources

Swapping Labeled Tokens on Graphs [PDF]

Theoretical Computer Science, 2014
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n 2) token swaps, and thus focus on the problem of minimizing the ...
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