Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.

the coprime graph $gg$ with a finite group $g$‎ ‎as follows‎: ‎take $g$ as the vertex set of $gg$ and join two distinct‎ ‎vertices $u$ and $v$ if $(|u|,|v|)=1$‎. ‎in the paper‎, ‎we explore how the graph‎ ‎theoretical properties of $gg$ can effect on the group theoretical‎ ‎properties of $g$‎.

Abstract Let (V,E) be the coprime graph with vertex set V = {1, 2, . . . , n} and edges (i, j) ∈ E if gcd(i, j) = 1. We determine the kernels of the coprime graph and its loopless counterpart as well as so-called simple bases for them (in case such bases exist), which means that basis vectors have entries only from {−1, 0, 1}. For the loopless version knowledge about the value distribution of M...

A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss c...

In the field of mathematics, there are many branches study, especially in graph theory, mathematically a is pair sets, which consists non-empty set whose members called vertices and distinct unordered pairs edges. One example from group coprime graph, where defined as two with different x y neighbors if only (|x|,|y|)=1. this author discusses Harmonic Index Gutman Coprime Graph Integer Group Mo...

A set A of positive integers is called a coprime Diophantine powerset if the shifted product ab + 1 of two different elements a and b of A is always a pure power, and the occuring pure powers are all coprime. We prove that each coprime Diophantine powerset A ⊂ {1, . . . , N} has |A| ≤ 8000 logN/ log logN for sufficiently large N . The proof combines results from extremal graph theory with numbe...

In this paper we study cycles in the coprime graph of integers. We denote by f(n, k) the number of positive integers m ≤ n with a prime factor among the first k primes. We show that there exists a constant c such that if A ⊂ {1, 2, . . . , n} with |A| > f(n, 2) (if 6|n then f(n, 2) = 2 3 n), then the coprime graph induced by A not only contains a triangle, but also a cycle of length 2l + 1 for ...