20 citations
4 papers
Dom-forcing sets in graphs
Susanth P, Charles Dominic, Premodkumar K P
A dominating set of vertices in a graph is called a \emph{dom-forcing set} if the sub-graph induced by must form a zero forcing se…
The average number of divisors of the Euler function
Sungjin Kim
The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see \cite{LP}). We impro…
Periodic modules over Gorenstein local rings
Amanda Croll
It is proved that the minimal free resolution of a module M over a Gorenstein local ring R is eventually periodic if, and only if, the class of M is torsion in a certain Z[t,t^{-1}…
Bi-serial DNA Encryption Algorithm(BDEA)
D. Prabhu, M. Adimoolam
The vast parallelism, exceptional energy efficiency and extraordinary information inherent in DNA molecules are being explored for computing, data storage and cryptography. DNA cry…