Results 191 to 200 of about 140,706 (235)
Author Correction: Glycometabolism change during Burkholderia pseudomallei infection in RAW264.7 cells by proteomic analysis. [PDF]
Sci RepLi X +5 more
europepmc +1 more source
Quantifying and comparing causal patterns in stochastic chemical reaction networks. [PDF]
NPJ Syst Biol ApplKahramanoğulları O.
europepmc +1 more source
Fault Diagnosis Method for Reciprocating Compressors Based on Spatio-Temporal Feature Fusion. [PDF]
Sensors (Basel)Xu H +6 more
europepmc +1 more source
RNA 2'-OH modification with stable reagents enabled by nucleophilic catalysis. [PDF]
RSC AdvKool ET +5 more
europepmc +1 more source
GNNDLD: Graph Neural Network with Directional Label Distribution
Chandramani Chaudhary +3 more
openalex +1 more source
Maspardin/SPG21 controls lysosome motility and TFEB phosphorylation through RAB7 positioning. [PDF]
J Cell BiolJacqmin T +5 more
europepmc +1 more source
Longitudinal cardiorespiratory wearable sleep staging in the home. [PDF]
Front NeurosciDavidson S +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 1997
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Caccetta, Louis, Jia, Rui-Zhong
openaire +2 more sources
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Caccetta, Louis, Jia, Rui-Zhong
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1992
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
Guichard, David R., Krussel, John W.
openaire +1 more source
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
Guichard, David R., Krussel, John W.
openaire +1 more source