Search

This manuscript introduces the family of Gould–Hopper–Lambda polynomials and establishes their quasi-monomial properties through the umbral method. This approach serves as a powerful mechanism to analyze the characteristic of multi-variable special polynomials. Several summation formulas for these polynomials are explored, and their operational identities are obtained using partial differential equations. The corresponding results for Hermite–Lambda polynomials are also obtained. In addition, a conclusion is given.

The generalization of strongly convex and strongly m-convex functions is presented in this paper. We began by proving the properties of a strongly modified (h,m)-convex function. The Schur inequality and the Hermite–Hadamard (H-H) inequalities are proved for the proposed class. Moreover, H-H inequalities are also proved in the context of Riemann–Liouville (R-L) integrals. Some examples and graphs are also presented in order to show the existence of this newly defined class.

Within the scope of this research, we introduce a novel category of bi-univalent functions. Horadam polynomials are utilized to characterize these functions by utilizing series from the Poisson distribution of the Miller-Ross type. Functions from these new categories have been used to construct estimates for the Fekete-Szego functional, as well as estimates of the Taylor-Maclaurin coefficients |l2| and |l3|. These projections were created for the methods in each of these brand-new subclasses. We made some additional discoveries after, focusing on the traits that contributed to our initial findings.

Since the constructions of p-adic q-integrals, these integrals as well as particular cases have been used not only as integral representations of many special functions, polynomials, and numbers, but they also allow for deep examinations of many families of special numbers and polynomials, such as central Fubini, Bernoulli, central Bell, and Changhee numbers and polynomials. One of the key applications of these integrals is for obtaining the symmetric identities of certain special polynomials. In this study, we focus on a novel generalization of degenerate central Fubini polynomials. First, we introduce two variable degenerate w-torsion central Fubini polynomials by means of their exponential generating function. Then, we provide a fermionic p-adic integral representation of these polynomials. Through this representation, we investigate several symmetric identities for these polynomials using special p-adic integral techniques. Also, using series manipulation methods, we obtain an identity of symmetry for the two variable degenerate w-torsion central Fubini polynomials. Finally, we provide a representation of the degenerate differential operator on the two variable degenerate w-torsion central Fubini polynomials related to the degenerate central factorial polynomials of the second kind.

The use of graph theory is prevalent in the field of network design, whereby it finds utility in several domains such as the development of integrated circuits, communication networks, and transportation systems. The comprehension of partition dimensions may facilitate the enhancement of network designs in terms of efficiency and reliability. Let VG be a vertex set of a connected graph and S⊂VG, the distance between a vertex v and subset S is defined as dv,S=mindv,xx∈S. An k-ordered partition of VG is Rp=Rp1,Rp2,…,Rpk and the identification code of vertex v with respect to Rp is the k-tuple rvRp=dv,Rp1,dv,Rp2,…,dv,Rpk. The k-partition Rp is said to be a partition resolving if rvRp, ∀v∈VG are distinct. Partition dimension is the minimum number k in the partition resolving set, symbolized by pdG. In this paper, we considered the families of graph named as Toeplitz network, and proved that the partition dimension of Tnt1,t2, where t1=2,3, and gcdt1,t2=1 is constant.

This article aims to introduce a set of hybrid matrix polynomials associated with λ-polynomials and explore their properties using a symbolic approach. The main outcomes of this study include the derivation of generating functions, series definitions, and differential equations for the newly introduced two-variable Hermite λ-matrix polynomials. Furthermore, we establish the quasi-monomiality property of these polynomials, derive summation formulae and integral representations, and examine the graphical representation and symmetric structure of their approximate zeros using computer-aided programs. Finally, this article concludes by introducing the idea of 1-variable Hermite λ matrix polynomials and their structure of zeros using a computer-aided program.

A noteworthy advancement within the discipline of q-special function analysis involves the extension of the concept of the monomiality principle to q-special polynomials. This extension helps analyze the quasi-monomiality of many q-special polynomials. This extension is a helpful tool for considering the quasi-monomiality of several q-special polynomials. This study aims to identify and establish the characteristics of the 2-variable q-Hermite–Appell polynomials via an extension of the concept of monomiality. Also, we present some applications that are taken into account.

In this paper, by using the Golden Calculus, we introduce the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers; additionally, we obtain various fundamental identities and properties associated with these polynomials and numbers, such as summation theorems, difference equations, derivative properties, recurrence relations, and more. Subsequently, we present summation formulas, Stirling–Fibonacci numbers of the second kind, and relationships for these polynomials and numbers. Finally, we define the new family of the generalized Apostol-type Frobenius–Euler–Fibonacci matrix and obtain some factorizations of this newly established matrix. Using Mathematica, the computational formulae and graphical representation for the mentioned polynomials are obtained.

In this paper, we determine the exact metric and fault-tolerant metric dimension of the benzenoid tripod structure. We also computed the generalized version of this parameter and proved that all the parameters are constant. Resolving set L is an ordered subset of nodes of a graph C, in which each vertex of C is distinctively determined by its distance vector to the nodes in L. The cardinality of a minimum resolving set is called the metric dimension of C. A resolving set Lf of C is fault-tolerant if Lf∖b is also a resolving set, for every b in Lf. Resolving set allows to obtain a unique representation for chemical structures. In particular, they were used in pharmaceutical research for discovering patterns common to a variety of drugs. The above definitions are based on the hypothesis of chemical graph theory and it is a customary depiction of chemical compounds in form of graph structures, where the node and edge represents the atom and bond types, respectively.

In this study, we introduce sine and cosine Bell-based Frobenius-type Eulerian polynomials, and by presenting several relations and applications, we analyze certain properties. Our first step is to obtain diverse relations and formulas that cover summation formulas, addition formulas, relations with earlier polynomials in the literature, and differentiation rules. Finally, after determining the first few zero values of the Eulerian polynomials, we draw graphical representations of these zero values.

Silica comes in three different crystalline forms, with quartz being the most common and plentiful in the crust of our planet. Other variations are created when quartz is heated. Each chemical structure may be deduced from graphs in which atoms alternate as vertices and edges as bonds, according to chemical graph theory. The latest advanced topic of resolvability parameters of a graph is, where the complete topology is formed in a particular way that every single atom’s unique location is obtained. The resolving basis, edge resolving basis, and some generalizations were investigated in this paper as resolvability characteristics of Quartz. Understanding and dealing with structures is made easier by transforming the entire topology into a unique form given by resolvability parameters.

In this paper, we seek to present some new identities for the elementary symmetric polynomials and use these identities to construct new explicit formulas for the Legendre polynomials. First, we shed light on the variable nature of elementary symmetric polynomials in terms of repetition and additive inverse by listing the results related to these. Sequentially, we have proven an important formula for the Legendre polynomials, in which the exponent moves one walk instead of twice as known. The importance of this formula appears throughout presenting Vieta’s formula for the Legendre polynomials in terms of their zeros and the results mentioned therein. We provide new identities for the elementary symmetric polynomials of the zeros of the Legendre polynomials. Finally, we propose the relationship between elementary symmetric polynomials for the zeros of Pnx and the zeros of Pn−1x.

A remarkably large number of polynomials and their extensions have been presented and studied. In this paper, we consider a new type of degenerate Changhee–Genocchi numbers and polynomials which are different from those previously introduced by Kim. We investigate some properties of these numbers and polynomials. We also introduce a higher-order new type of degenerate Changhee–Genocchi numbers and polynomials which can be represented in terms of the degenerate logarithm function. Finally, we derive their summation formulae.

Among the inorganic compounds, there are many influential crystalline structures, and magnesium iodide is the most selective. In the making of medicine and its development, magnesium iodide is considered a multipurpose and rich compound. Chemical structures and networks can be studied by given tools of molecular graph theory. Given tools of molecular graph theory can be studied for chemical structures and networks, which are considered economical with simple methodology. Edge weight-based entropy is a recent advent tool of molecular graph theory to study chemical networks and structures. It provides the structural information of chemical networks or their related build-up graphs and highlights the molecular properties in the form of a polynomial function. In this work, we provide the edge weight-based entropy of magnesium iodide structure and compute different entropies, such as Zagreb and atom bond connectivity entropies.