Results 41 to 50 of about 2,638 (125)

Distance Magic Labeling of Corona Product of Graphs

InPrime: Indonesian Journal of Pure and Applied Mathematics
Let 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. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a ...
openaire   +1 more source

DNP-Enhanced Magic Angle Spinning Solid-State NMR Spectroscopy to Determine RNA-Ligand Interactions. [PDF]

J Am Chem Soc
Sudakov A, Becker-Baldus J, Mineev KS, Wacker A, Jonker HRA, Nussbaumer F, Plangger R, Glaubitz C, Schwalbe H.   +8 more
europepmc   +1 more source

Tuning mitotic recombination with patterned DNA nicks for precision mosaic analysis. [PDF]

Proc Natl Acad Sci U S A
Shen Y, Yeung AT, Wang B, Yeh CT, Ditchfield P, Korn E, Han C.   +6 more
europepmc   +1 more source

A genome-wide MAGIC kit for recombinase-independent mosaic analysis in <i>Drosophila</i>. [PDF]

Elife
Shen Y, Yeung AT, Ditchfield P, Korn E, Clements R, Chen X, Wang B, Huang Z, Sheen M, Jarman PA, Han C.   +10 more
europepmc   +1 more source

Collecting Large Datasets of Unambiguous Structural Restraints for Protein Structure Determination by 4D Proton-Detected Solid-State NMR. [PDF]

Chemphyschem
Chevelkov V, Lange S, Lange A.
europepmc   +1 more source

Carbon-13 Centerband-Only Detection of EXchange with Dynamic Nuclear Polarization. [PDF]

Chemphyschem
Cherian Varkey A, Xue K, Nimerovsky E, Becker S, Andreas LB.   +4 more
europepmc   +1 more source

Microglial cathepsin B is necessary for neuronal efferocytosis in zebrafish and mice during brain development. [PDF]

Nat Commun
Silva NJ, Anderson SR, Mula SA, Escoubas CC, Nakajo H, Molofsky AV.   +5 more
europepmc   +1 more source

¹H-¹H Interatomic Distances in Paracetamol-Based Structures Unveiled by Double-Quantum NMR and DFT Calculations. [PDF]

Molecules
Balodis M, Stevensson B, Majhi D, Nguyen TM, Hareendran C, Edén M.   +5 more
europepmc   +1 more source

Further results on distance magic labeling of graphs

Journal of Mathematical and Computational Science, 2021
openaire   +1 more source

On A-Distance (Anti)magic Labeling of Prime Graph over the Ring Z_n

CAUCHY: Jurnal Matematika Murni dan Aplikasi
Let G = (V, E) be a simple graph with n vertices, and let A be an abelian group of order n. Let f: V(G) → A be a bijection, and define the weight of a vertex x by w(x) = Σy ∈ N(x) f(y), where N(x) denotes the open neighborhood of x. We call f an A-distance magic labeling if all vertex weights are equal, and an A-distance antimagic labeling if the ...
openaire   +1 more source