Results 31 to 40 of about 1,962,778 (284)
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
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
Fu, Hung-Lin, Huang, Kuo-Ching
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
Circulation in Computer Science, 2017 We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph ...
M. A. Seoud +2 more
openaire +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
Edge vertex prime labeling of some graphs
Malaya Journal of Matematik, 2019 Let G = (V (G),E(G)) be a graph with p vertices and q edges. A bijective function f : V (G) ⋃ E(G)→{1,2,3, ..., p+ q} is said to be an edge vertex prime labeling, if for any edge xy ∈ E(G), it is satisfies that f (x), f (y) and f (xy) are pairwise ...
M. Simaringa, S. Muthukumaran
semanticscholar +1 more source
Review of Post-embedding Immunogold Methods for the Study of Neuronal Structures
Frontiers in Neuroanatomy, 2021 The post-embedding immunogold (PI) technique for immunolabeling of neuronal tissues utilizing standard thin-section transmission electron microscopy (TEM) continues to be a prime method for understanding the functional localization of key proteins in ...
Ronald S. Petralia, Ya-Xian Wang
doaj +1 more source
Edge vertex prime labeling of graphs
Malaya Journal of Matematik, 2019 A bijective labeling f : V (G) ⋃ E(G)→{1,2,3, ..., |V (G) ⋃ E(G)|} is an edge vertex prime labeling if for any edge uv ∈ E(G), the numbers f (u), f (v) and f (uv) are pairwise relatively prime.
M. Simaringa, S. Muthukumaran
semanticscholar +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
Prime Cordial Labeling of Some Graphs [PDF]
Journal of Physics: Conference Series, 2021 Abstract A bijectionfrom the vertex set V of a graph G to {1,2,…|V|} is called a prime cordial labeling of G if each edge uv is assigned the label 1 if gcd (f (u), f (v)) = 1 and 0 if gcd (f (u), f (v)) > 1, where the number of edges labeled with 0 and the number of edges labeled with 1 differ at most by one.
K. Gayathri, A. Sasikala, C. Sekar
openaire +1 more source