On a new summation formula for basic bilateral hypergeometric series and its applications.
On a -analogue of Sándor's function.
A note on strongly multiplicative graphs
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].
Page 1