Results 1 to 10 of about 1,036,687 (287)
On Prime Index of a Graph [PDF]
In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
doaj +3 more sources
Prime vertex-minors of a prime graph [PDF]
33 pages, 11 figures.
Donggyu Kim, Sang-il Oum
openaire +4 more sources
Weakly Completely Prime Graph [PDF]
In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj +2 more sources
Birecognition of prime graphs, and minimal prime graphs
Given a graph [Formula: see text], a subset [Formula: see text] of [Formula: see text] is a module of [Formula: see text] if for each [Formula: see text], [Formula: see text] is adjacent to all the elements of [Formula: see text] or to none of them.
Houmem Belkhechine +2 more
openaire +6 more sources
Prime labeling of graphs constructed from wheel graph
A prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime.
Baha' Abughazaleh, Omar A. Abughneim
doaj +5 more sources
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
doaj +2 more sources
Prime Graph over Cartesian Product over Rings and Its Complement [PDF]
Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Farah Maulidya Fatimah +2 more
doaj +4 more sources
Prime labelings on a 3xn grid graph
It is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p2, there exists a prime labeling on the pxn grid graph Pm x Pn. Also, it is known that the
Stephen J. Curran, Matt A. Ollis
doaj +4 more sources
Prime Labelings of Snake Graphs [PDF]
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
core +4 more sources

