Results 181 to 190 of about 10,794,216 (210)

Sentiment analysis of cancer screening in Chinese social media: Qualitative studies based on machine learning. [PDF]

PLoS One
Zhou Q, Qian L, Wu L, Wu H, Ye J, Yu Q, Gu X, Zhu Y.   +7 more
europepmc   +1 more source

Molecular tuning of DNA framework-programmed silicification by cationic silica cluster attachment. [PDF]

Proc Natl Acad Sci U S A
Jing X, Wang H, Huang J, Liu Y, Li Z, Chen J, Xu Y, Li L, Lin Y, Buratto D, Xia Q, Pan M, Wang Y, Li M, Zhou R, Mann S, Fan C, Liu X.   +17 more
europepmc   +1 more source

Newsletter of the The Magic Lantern Society of the United States and Canada, April 2016

, 2016

core  

Bipolar membranes reveal surface-hydroxyl-structure-dependent water dissociation mechanism. [PDF]

Nat Commun
Lv H, Yang C, Sun M, Yang Y, Li F, Ou P, Wang Y.   +6 more
europepmc   +1 more source

Analysis of the MODIST Sequence for Selective Proton-Proton Recoupling. [PDF]

J Phys Chem A
Nimerovsky E, Stampolaki M, Varkey AC, Becker S, Andreas LB.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Characterize group distance magic labeling of Cartesian product of two cycles

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangneng Zeng, Guixin Deng, Caimei Luo
exaly   +3 more sources

Group distance magic labeling of tetravalent circulant graphs

Discrete Applied Mathematics
Let \(G = (V , E)\) be a finite simple graph of order \(n\) and let \(\Gamma\) be an abelian group of order \(n\). A \(\Gamma\)-distance magic labeling of \(G\) is a bijection \(\varphi :V\rightarrow \Gamma\) for which there exits \(\gamma \in \Gamma\) such that \(\Sigma_{x \in N(V)} \varphi(x)=\gamma\) for any \(v \in V\), where \(N(v)\) is the ...
Guixin Deng
exaly   +3 more sources

Note on the Group Distance Magic Labeling of Direct Product of Two Cycles

Bulletin of the Iranian Mathematical Society
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guixin Deng
exaly   +3 more sources

A Heuristic for Distance Magic Labeling [PDF]

Procedia Computer Science, 2015
A distance magic labeling of a graph G with magic constant k is a bijection λ from the V(G) into {1, 2,. . ., |V(G)|}, such that ∑u∈N(v) λ(u) = k for every vertex v.
Rinovia Simanjuntak
exaly   +2 more sources

Some distance magic graphs

AKCE International Journal of Graphs and Combinatorics, 2018
A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho
exaly   +2 more sources