Results 61 to 70 of about 307 (247)
Graceful Labeling of Balanced Stars of Paths
Electronic Notes in Discrete Mathematics, 2003 Abstract If the vertices of a tree on n vertices are labeled by the distinct numbers l,2,…, n , in such a way that the set of edge-differences (i.e., the differences between the labels on adjacent pairs of vertices) is exactly {1, 2,…, n − 1}, then such a labeling is called a graceful labeling. The graceful tree conjecture of Ringel and Kotzig
R. Badrinath, Pratima Panigrahi
openaire +1 more source
Advanced Science, EarlyView.ABSTRACT Doxorubicin‐induced cardiomyopathy (DIC) remains a dose‐limiting clinical challenge. This study reveals that cardiac vascular endothelial cells (CVECs) act as initial sensors of doxorubicin cardiotoxicity: circulating doxorubicin activates the cGAS‑STING pathway in CVECs, triggering NLRP3 inflammasome‑mediated pyroptosis and release of ...
Wang Jun +10 more
wiley +1 more source
Graceful and Cordial Labeling Of Subdivision Of Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract An edge uv is said to be subdivided if the edge uv is replaced by the path P : u w v , where w is the new vertex. A graph obtained by subdividing each edge of a graph G is called subdivision of the graph G, and is denoted by S ( G ) .
K. Sankar, G. Sethuraman 0001
openaire +1 more source
Advanced Science, EarlyView.An edible biohybrid platform triggers nanoplastics (NPs) aging and agglomeration by in situ generating hydroxyl radicals within the intestine. The enlarged NPs are unable to penetrate the intestine and are subsequently excreted. Simultaneously, probiotic biofilms reinforce the intestinal barrier.
Su Zhou +4 more
wiley +1 more source
Modular gracious labellings of trees [PDF]
, 2001 A gracious labelling g of a tree is a graceful labelling in which, treating the tree as a bipartite graph, the label of any edge (d,u) (d a ‘down’ and u an ‘up’ vertex) is g(u)−g(d). A gracious k-labelling is one such that each residue class modulo k has
Grannell, M.J. +5 more
core +1 more source
Adaptive Coordination Engineering for Efficient and Robust H2 Release
Advanced Science, EarlyView.β‐H elimination is a pivotal but challenging step in homogeneous formic acid dehydrogenation reactions due to strict hydride‐metal matching. By using a rationally designed Pd1Ag2 bimetallic system with adaptive Pd1‐Ag2/L2 coordination and formate bridges, it enables boosted formic acid dehydrogenation under ambient air (7.7 times higher than a Pd ...
Xiaolin Jiang +8 more
wiley +1 more source
Hemoglobin's α‐Helix‐to‐β‐Sheet Transition Enables Targeted mRNA Delivery to the Lung
Advanced Science, EarlyView.Acidic heating converts hemoglobin into β‐sheet‐rich fibrils with positively charged surfaces. These hemoglobin fibrils electrostatically complex IL‐11 scFv mRNA, selectively bind circulating platelets, and hitchhike to the lung, where they are enriched in fibroblasts.
Xihua Liu +11 more
wiley +1 more source
Advanced Science, EarlyView.This study introduces a biomimetic “nanofusion” platform that integrates the biostability of threose nucleic acids (TNA) with homotypic cell‐membrane cloaking to combat drug‐resistant TNBC. By leveraging a non‐canonical membrane‐fusion pathway for direct cytosolic delivery, the platform bypasses endosomal sequestration. To achieve potent AKT2 silencing
Wei Zheng +7 more
wiley +1 more source
On α-labellings of lobsters and trees with a perfect matching [PDF]
, 2019 A graceful labelling of a tree T is an injective function f: V(T) -> {0, ..., vertical bar E(T)vertical bar} such that {vertical bar f(u) - f (v)vertical bar: uv is an element of E(T)} = {1, ..., vertical bar E(T)vertical bar}.
Richter, R. Bruce +5 more
core +1 more source
On $k$-Super Graceful Labeling of Graphs
, 2018 Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon +2 more
openaire +3 more sources