Results 11 to 20 of about 641,798 (254)
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 +2 more sources
PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS [PDF]
BarekengGraph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph with a vertex-set and an edge-set .
Desi Rahmadani +4 more
doaj +2 more sources
Octagonal prime graceful labeling [PDF]
Ratio MathematicaLet G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj +2 more sources
On prime labeling of union of tadpole graphs [PDF]
, 2022 summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then
Patel, Sanjaykumar K., Vasava, Jayesh B.
core +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
Consecutive Prime and Highly Total Prime Labeling in Graphs [PDF]
, 2020 This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982.
Scholle, Robert
core +1 more source
Some Prime Labeling Results of H-Class Graphs [PDF]
, 2013 Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G(V,E) is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, 3, · · · , |V (G)| such that for each edge xy the labels ...
A.Nagarajan +3 more
core +1 more source
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
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