Results 21 to 30 of about 2,130,896 (179)
Distance Magic Labeling of Corona Product of Graphs
InPrimeLet G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v) is the set of neighbors of vertex v.
Christyan Tamaro Nadeak
doaj +2 more sources
Group distance magic cubic graphs
Discussiones Mathematicae Graph TheoryA $Γ$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $Γ$ of order $n$, for which there exists $μ\in Γ$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $μ$. In this case, the element $μ$ is called the \emph{magic constant of} $G$.
Sylwia Cichacz, Štefko Miklavič
doaj +4 more sources
Open Distance-Pattern Uniform Graphs [PDF]
, 2009 All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core +1 more source
Note on group distance magicness on product graphs
Contributions to Discrete Mathematics, 2021 If $l$ is a bijection from the vertex set $V(G)$ of a graph $G$ to an additive abelian group $\Gamma$ of $|V(G)|$ elements such that for any vertex $u$ of $G$, the weight $\sum_{v\in N_{G}(u)}l(v)$ is $\mu$, where $\mu \in \Gamma$, then $l$ is a $\Gamma$-distance magic labeling of $G$.
Prajeesh, Appattu Vallapil +1 more
openaire +2 more sources
Independent Complementary Distance Pattern Uniform Graphs [PDF]
, 2009 A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena +3 more
core +1 more source
Advanced Materials, EarlyView.Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger +14 more
wiley +1 more source
Slc44a2 Deficiency Unveils an IFN‐I–Dependent Feedback Control of pDC Egress
Advanced Science, EarlyView.Working model of SLC44A2‐mediated maintenance of pDC homeostasis. This model illustrates two central mechanisms by which SLC44A2 regulates pDC homeostasis: (1) SLC44A2 limits IFN‐I production by exporting amino acids (T, N, Q), thereby preventing spontaneous pDC activation.
Ruiqun Chen +11 more
wiley +1 more source
Advanced Science, EarlyView.This study reports D34 as the first PROTAC degrader that targets the 3C protease of picornaviruses. D34 effectively degrades EV71 3C protease via the ubiquitin‐proteasome pathway. More importantly, D34 exhibits a high resistance barrier and shows broad‐spectrum antiviral activity against multiple picornaviruses, highlighting its potential as a novel ...
Weilong Deng +9 more
wiley +1 more source
On the uniqueness of d-vertex magic constant
Discussiones Mathematicae Graph Theory, 2014 Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . .
Arumugam S. +2 more
doaj +1 more source
Cancer‐Associated BCL‐2 Mutants Reveal Mechanisms Towards Venetoclax Resistance
Advanced Science, EarlyView.Venetoclax (VEN) resistance in chronic lymphocytic leukemia arises from diverse BCL2 mutations. We map mechanisms contributing to VEN resistance across common BCL‐2 variants. G101V and D103Y reduce drug binding and increase sequestration of pro‐apoptotic proteins. V156D blocks VEN allosterically.
Jonas Aufdermauer +9 more
wiley +1 more source