Results 11 to 20 of about 141,920 (188)
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
Internal labelling operators and contractions of Lie algebras [PDF]
, 2007 We analyze under which conditions the missing label problem associated to a reduction chain $\frak{s}^{\prime}\subset \frak{s}$ of (simple) Lie algebras can be completely solved by means of an In\"on\"u-Wigner contraction $\frak{g}$ naturally related to ...
Campoamor-Stursberg, R.
core +4 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
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
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
Perfect (super) Edge-Magic Crowns [PDF]
, 2017 A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G
López Masip, Susana Clara +2 more
core +4 more sources
International Journal of Mathematics and Soft Computing, 2015 In this paper we introduce neighborhood-prime labeling and investigate neighborhoodprime labelings for paths, cycles, helm, closed helm and flower. Also we establish a sufficient condition for a graph to admit neighborhood-prime labeling.
N. N. Shrimali, S. K. Patel
openaire +1 more source