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.

Topological descriptors are numerical parameters of a molecular graph which characterize its molecular topology and are usually graph invariant. In QSAR/QSPR study, physico-chemical properties and topological indices such as Randić, atom-bond connectivity [Formula: see text] and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. The counting polynomials are those polynomials having at exponent the extent of a property partition and coefficients the multiplicity/occurrence of the corresponding partition. All of the studied interconnection mesh networks in this paper are motivated by the molecular structure of a Sodium chloride NaCl. In this paper, Omega, Sadhana and PI polynomials are computed for mesh-derived networks. These polynomials were proposed on the ground of quasi-orthogonal cut edge strips in polycyclic graphs. These polynomials count equidistant and non-equidistant edges in graphs. Moreover, the analytical closed formulas of these polynomials for mesh-derived networks are computed for the first time.

We introduce and study the graphs whose vertex set is reduced residue system mod n such that two distinct vertices a and b are adjacent provided that a 2 ≡ b 2 (mod n).

No abstract

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 different orders are adjacent provided that o(a) divides o(b) or o(b) divides o(a).