Results 31 to 40 of about 612,378 (298)
Imaging trans-cellular neurexin-neuroligin interactions by enzymatic probe ligation. [PDF]
PLoS ONE, 2013 Neurexin and neuroligin are transmembrane adhesion proteins that play an important role in organizing the neuronal synaptic cleft. Our lab previously reported a method for imaging the trans-synaptic binding of neurexin and neuroligin called BLINC (Biotin
Daniel S Liu +4 more
doaj +1 more source
Ratio Mathematica, 2023 Any graph operation of a graph drive only one graph structure. But eccentric graph operation of almost all the graphs drives more than one graph structure, which are interesting and marvelous one. The eccentric graph of G is denoted by ecc(G).
K Periasamy +2 more
doaj +1 more source
Prime Labelings of Snake Graphs
The PUMP Journal of Undergraduate Research, 2019 A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs.
Abigail Bigham +4 more
openaire +2 more sources
Total neighborhood prime labeling of some trees
, 2022 Let G be a graph with p vertices and q edges. A total neighborhood prime labeling of G is a labeling in which the vertices and edges are assigned labels from 1 to p + q such that the gcd of labeling in the neighborhood of each non degree 1 vertex is ...
Rajesh Kumar, T. J., RAJESH KUMAR JT
core +1 more source
Frequency Assignment Model of Zero Divisor Graph
Journal of Applied Mathematics, 2021 Given a frequency assignment network model is a zero divisor graph Γ=V,E of commutative ring Rη, in this model, each node is considered to be a channel and their labelings are said to be the frequencies, which are assigned by the L2,1 and L3,2,1 labeling
R. Radha, N. Mohamed Rilwan
doaj +1 more source
EBSL: supporting deleted node label reuse in XML [PDF]
, 2010 Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limit the growth rate in node label size, and consequently increase query ...
O\u27Connor, Martin F. +4 more
core +2 more sources
Coprime and prime labelings of graphs
J. Integer Seq., 2016 14 pages, this version is the one accepted by the Journal of Integer ...
Adam H. Berliner +5 more
openaire +4 more sources
Conflict vs Causality in Event Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature.
Daniele Gorla +2 more
doaj +1 more source
International Journal For Multidisciplinary Research, 2023 A graph G = (V(G), E(G)) is observed to admit prime labeling, if a graph that receives prime labeling is called prime graph .In this research article we investigate that the Nauru graph admits prime labeling. We construct the mirror graph and shadow graph of the Nauru graph.
K.Bharatha Devi -, S.Lakshminarayanan -
openaire +1 more source
Some results on cordiality labeling of generalized Jahangir graph
Indonesian Journal of Combinatorics, 2017 In this paper we consider the cordiality of a generalized Jahangir graph $J_{n,m}$. We give sufficient condition for $J_{n,m}$ to admit (or not admit) the prime cordial labeling, product cordial labeling and total product cordial labeling.
Roslan Hasni +2 more
doaj +1 more source