Results 21 to 30 of about 1,962,778 (284)
Prime Labeling to Drums Graphs
Annals of Pure and Applied Mathematics, 2018 A.Edward Samuel, S. Kalaivani
openaire +2 more sources
Even-Odd Prime Harmonious Graphs [PDF]
Pandian Journal of Mathematical Sciences, 2022 The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj
Labeling of Unique Sequences in Double-Stranded DNA at Sites of Vicinal Nicks Generated by Nicking Endonucleases [PDF]
, 2008 We describe a new approach for labeling of unique sequences within dsDNA under nondenaturing conditions. The method is based on the site-specific formation of vicinal nicks, which are created by nicking endonucleases (NEases) at specified DNA sites on ...
Frank-Kamenetskii, Maxim D., Kuhn, Heiko
core +3 more sources
Antimagic Labelings of Caterpillars [PDF]
, 2019 A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Lozano, Antoni +2 more
core +2 more sources
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
Tuples of polynomials over finite fields with pairwise coprimality conditions [PDF]
, 2018 Let q be a prime power. We estimate the number of tuples of degree bounded monic polynomials (Q1, . . . , Qv) ∈ (Fq[z])v that satisfy given pairwise coprimality conditions.
Arias de Reyna Martínez, Juan +1 more
core +1 more source
, 2022 An odd prime labeling is a variation of a prime labeling in which the vertices of a graph of order~$n$ are labeled with the distinct odd integers $1$ to $2n-1$ so that the labels of adjacent vertices are relatively prime. This paper investigates many different classes of graphs including disjoint unions of cycles, stacked prisms, and particular types ...
Carter, Holly, Fox, N. Bradley
openaire +2 more sources
Prime labeling of families of trees with Gaussian integers
AKCE International Journal of Graphs and Combinatorics, 2016 A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural numbers such that any two adjacent vertices have relatively prime labels.
Steven Klee, Hunter Lehmann, Andrew Park
doaj +1 more source
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources