4 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2018
Efficient Methods in Counting Generalized Necklaces
V Ch Venkaiah
It is shown in [7] by Venkaiah in 2015 that a category of the number of generalized can be computed using the expression \begin{equation*} e(n, q) = \frac{1}{(q-1) ord(λ) n} \sum^{…
cs.CR2017★ 4 cited
Node Authentication Using BLS Signature in Distributed PKI Based MANETS
N Chaitanya Kumar, Abdul Basit, Priyadarshi Singh +2
Authenticating a node in mobile ad-hoc networks is a challenging task due to their dynamic and resource constraint infrastructure. For this purpose, MANETS adopt two kinds of appro…
cs.DM2014
Equivalence of lower bounds on the number of perfect pairs
V. Ch. Venkaiah, K. Ramanjaneyulu, Neelima Jampala +1
Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(K_{n}) \geq n*phi(n)/2 and…