Results 11 to 20 of about 38,200 (260)
Prime Labeling of H- Super Subdivision of Y-tree Related Graphs
Ratio Mathematica, 2023 A graph G with p points is called a prime labeling , if it possible to label the points x 2 V with distinct labels f(x) from f1;2; :::; pg in such a way that for each line e = uv gcd (f(u); f(v)) = 1 .
Meena S, Gajalakshmiy G
doaj +1 more source
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph.
Richard Low, Dan Roberts
doaj +1 more source
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
Discrete Mathematics, 1994 The paper is devoted to the study of prime graphs, that is finite graphs that admit a prime labelling. A prime labelling of a graph \(G=(V,E)\) is a bijection \(f: V\to \{1,2,\dots,| V|\}\) such that if \(e= \{u,v\}\in E\) then \(\text{GCD}(f(u),f(v))= 1\). Some results concerning bipartite graphs are obtained; all trees of order up to 15 are proved to
Hung-Lin Fu, Kuo-Ching Huang
openaire +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
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
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
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
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