Results 1 to 10 of about 312,664 (251)

Weakly Completely Prime Graph

Wasit Journal for Pure Sciences, 2023
     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

Some New Odd prime Graphs

Ratio Mathematica, 2023
For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one.
Meena S, Gajalakshmiy G
doaj   +2 more sources

On k-prime graphs

Open Mathematics
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj   +2 more sources

‎$‎4‎$‎-Regular prime graphs of nonsolvable groups [PDF]

International Journal of Group Theory, 2020
Let $G$ be a finite group and $\cd(G)$ denote the character degree set for $G$. The prime graph $\DG$ is a simple graph whose vertex set consists of prime divisors of elements in $\cd(G)$, denoted $\rho(G)$.
Donnie Kasyoki, Paul Oleche
doaj   +3 more sources

Prime labeling of graphs constructed from wheel graph

Heliyon
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   +3 more sources

A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]

PLoS ONE
For the construction of a common prime divisor graph, we consider an integer [Formula: see text] with its prime factorization, where [Formula: see text] are distinct primes and [Formula: see text] are fixed positive integers. Every divisor of the integer
Ali N A Koam, Azeem Haider, Ali Ahmad, Moin Akhtar Ansari   +3 more
doaj   +2 more sources

On Prime Index of a Graph

Ratio Mathematica, 2023
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   +1 more source

Birecognition of prime graphs, and minimal prime graphs

Discrete Mathematics, Algorithms and Applications, 2021
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.
Ille, Pierre, Belkhechine, Houmem, Ben Salha, Cherifa   +2 more
openaire   +4 more sources

Prime Graph over Cartesian Product over Rings and Its Complement

JTAM (Jurnal Teori dan Aplikasi Matematika), 2023
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, Vira Hari Krisnawati, Noor Hidayat   +2 more
doaj   +1 more source

Prime labeling in the context of web graphs without center

AKCE International Journal of Graphs and Combinatorics, 2021
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj   +1 more source