Results 21 to 30 of about 1,802,459 (260)
Relatively Prime Detour Domination Number of Some Switching Graphs
Ratio Mathematica, 2023 In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, then it
C Jayasekaran, L. G. Binoja
doaj +1 more source
Proceedings of the American Mathematical Society, 2019 Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the nonreal zeros of ζ ( s ) \zeta (s) , that the set of real numbers x ≥ 2 x\ge 2 for which π ( x ) &
Lichtman, Jared Duker +2 more
openaire +2 more sources
Counting stabiliser codes for arbitrary dimension [PDF]
Quantum, 2023 In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross \cite{Gross2006} the number of $[[n,k]]_d$ stabilizer codes was computed for the case ...
Tanmay Singal +5 more
doaj +1 more source
Prime ideal graphs of commutative rings
Indonesian Journal of Combinatorics, 2022 Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj +1 more source
Carmichael Numbers with a Prime Number of Prime Factors
, 2022 Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.
openaire +3 more sources
Thirty-nine perfect numbers and their divisors
International Journal of Mathematics and Mathematical Sciences, 1986 The following results concerning even perfect numbers and their divisors are proved: (1) A positive integer n of the form 2p−1(2p−1), where 2p−1 is prime, is a perfect number; (2) every even perfect number is a triangular number; (3) τ(n)=2p, where τ(n ...
Syed Asadulla
doaj +1 more source
Formulae of the Frobenius number in relatively prime three Lucas numbers [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2020 In this paper, we find the explicit formulae of the Frobenius number for numerical semigroups generated by relatively prime three Lucas numbers 2 , L L i i and Lil for given integers i ≥ 3, l ≥ 4 .
Ratchanok Bokaew +2 more
doaj +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source
Three topics in additive prime number theory
, 2007 This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short reader's guide to some recent joint work with T.Tao ...
Green, Ben
core +2 more sources
Prime Number Sieving—A Systematic Review with Performance Analysis
AlgorithmsThe systematic generation of prime numbers has been almost ignored since the 1990s, when most of the IT research resources related to prime numbers migrated to studies on the use of very large primes for cryptography, and little effort was made to ...
Mircea Ghidarcea, Decebal Popescu
doaj +1 more source