Results 51 to 60 of about 1,934,842 (247)
Advanced Science, EarlyView.Ni‐intercalated graphene on SiC is achieved through a scalable colloidal nanoparticle deposition route. 2D heterostructures show preserved graphene band structure, stable under ambient conditions, and robust interfacial magnetism. Intercalated 2D Ni represents a promising candidate for next‐generation spintronic devices and is a scalable pathway to ...
Ylea Vlamidis +7 more
wiley +1 more source
On 14-regular distance magic graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G)→{1, 2, …, n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for
Petr Kovář, Matěj Krbeček
doaj +1 more source
Scientific Reports, 2017 The dynamic protein-protein and protein-ligand interactions of integral bitopic membrane proteins with a single membrane-spanning helix play a plethora of vital roles in the cellular processes associated with human health and diseases, including ...
Kazutoshi Yamamoto +4 more
doaj +1 more source
Enumerating the distance magic labelings of a distance magic graph
Let $G = (V,E)$ be a graph of order $n$. A bijection $f : V \rightarrow \{1,2,\cdots,n\}$ is a distance magic labeling of $G$ if there exists a positive integer $k$ such that $\sum_{u \in N(v)}f(u) = k$ for all $v \in V$, where $N(v)$ is the neighborhood of $v$. Any graph which admits a distance magic labeling is called a distance magic graph.
Prajeesh, A V, Paramasivam, Krishnan
openaire +2 more sources
Group distance magic labeling of Cartesian products of cycles, Australasian
, 2020 A group distance magic labeling of a graph G(V, E) with |V | = n is an injection from V to an abelian group Γ of order n such that the sum of labels of all neighbors of every vertex x ∈ V is equal to the same element µ ∈ Γ. We completely characterize all
Dalibor Froncek
core
Magic labelings of distance at most 2
, 2013 For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) ={\sf k}$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$.
Simanjuntak, Rinovia +4 more
openaire +2 more sources
Distance Magic Graphs - a Survey [PDF]
, 2011 Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V → {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>Σ f(u) = k &
Arumugam, S. (S) +2 more
core
, 2019 This work is focused on the radio galaxy NGC 1275, the central galaxy of the Perseus cluster. The source was part of a MAGIC monitoring program and showed a very strong flare the night between 31st of December 2016 and the 1st of January 2017.
MAGIC Collaboration +1 more
core +1 more source
Advanced Energy Materials, EarlyView.Trace water is acting as a constructive mediator in 2LiCl–GaF3, markedly increasing ionic conductivity while reorganizing local coordination. Hydration creates localized Li+ solvation environments and partially dissociates ion pairs, enhancing Li‐ion mobility.
Youngkyung Kim +10 more
wiley +1 more source
Advanced Energy Materials, EarlyView.A combination of discrete and finite element method models for the current collector deformation and electrochemical performance analysis, respectively. The models are calibrated and validated with electrochemical and imaging data of hard carbon electrodes. These electrodes were manufactured with different parameters (slurry solid contents of 35 and 40
Soorya Saravanan +12 more
wiley +1 more source