This paper introduces a new integral operator in q-analog for multivalent functions. Using as an application of this operator, we study a novel class of multivalent functions and define them. Furthermore, we present many new properties of these functions. These include distortion bounds, sufficiency criteria, extreme points, radius of both starlikness and convexity, weighted mean and partial sum for this newly defined subclass of multivalent functions are discussed. Various integral operators are obtained by putting particular values to the parameters used in the newly defined operator.
In today’s technological world, confidentiality is an important issue to deal with, and it is carried out through different proficiencies. Cryptography is a scientific technique of securing a communication from unauthenticated approach. There exist many encryption algorithms in cryptography for data security. The need of new nonstandard encryption algorithms has been raised to prevent the communication from traditional attacks. This paper proposes some new encryption algorithms for secure transmission of messages using some special corona graphs and bipartite graph along with some algebraic properties. These proposed encryption schemes will lead to more secure communication of secret messages.
The graphical representation of finite groups is studied in this paper. For each finite group, a simple graph is associated for which the vertex set contains elements of group such that two distinct vertices x and y are adjacent iff x2 = y2. We call this graph an equal‐square graph of the finite group G, symbolized by ES(G). Some interesting properties of ES(G) are studied. Moreover, examples of equal‐square graphs of finite cyclic groups, groups of plane symmetries of regular polygons, group of units U(n), and the finite abelian groups are constructed.
1 December 2018 in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having di erent orders are adjacent provided that o ( a ) divides o ( b ) or o ( b ) divides o ( a ).
1 January 2020 in Journal of Information and Optimization Sciences
A recent subject of study linking commutative ring theory with graph theory has been the concept of the zero divisor graph of a commutative ring. The zero divisor graph of a commutative ring exhibits a remarkable amount of graphical structure. Let G(R) be the zero divisor graph introduced by Beck [9], whose vertices are the elements of a ring R such that two distinct vertices x, y are adjacent provided that xy = 0. Let G(R) be the zero divisor graph introduced by Anderson, Livingston [5] whose vertices are the non-zero zero divisors of the ring R such that two distinct vertices x, y are adjacent provided that xy = 0. Here, the authors investigate the size of the graphs G(Z(n)), G(Z(n)).
In this paper, we study the generalized derivations of MA-semirings with involution. We discuss some differential identities satisfied by the generalized derivations which force the semirings with involution to be commutative.