Results 21 to 30 of about 141,920 (188)
, 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
Common closed neighbourhood prime labeling
Journal of Physics: Conference Series, 2021 AbstractLetG= (VG,EG) be a connected graph of ordern.A bijectiong:VG→ {1,2,3,…,n} is said to be prime labeling if for each two distinct verticesa,b ∈Vcwhichais adjacent tob, gcd(g(a),g(b))= 1. A graph that satisfies the prime labeling is called a prime graph. Graph G is a neighbourhood prime graphif there is a bijectiong: VG→{1,2,3,…,n}so that for each
null Rinurwati, A S Alfiyani
openaire +1 more source
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
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
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
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
Classifying Families of Character Degree Graphs of Solvable Groups [PDF]
, 2018 We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion.
Bissler, Mark W., Laubacher, Jacob
core +2 more sources
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