http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7149 JAEM 2026, Vol 16, No 1 koleksiyonunu içerir. 2026-04-14T21:29:47Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7159 Certain subclass of bi-univalent functions defined by q-derivative operator involving Poisson distribution Nandini, P.; Latha, Satyanarayana In this paper, by using the q-derivative operator, we define a new subclass of bi-univalent functions involving Poisson distribution series associated with Horadam polynomials. We find estimates for the general Taylor-Maclaurin coefficients and also Fekete-Szegö problem for this class. 2026-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7158 A numerical solution to nonlinear ordinary differential equations based on Bell polynomials Erdem Biçer, Kübra; Yıldız Nohutcu, Gökçe This article examines the solutions of high-order nonlinear ordinary differential equations with cubic terms under initial conditions using Bell polynomials, their derivatives, and collocation points. The nonlinear differential equation and the corresponding conditions are transformed into matrix form by means of Bell polynomials and reduced to an algebraic system. From the solution of this system, the unknown Bell coefficients are determined. By substituting these coefficients, the approximate solution of the problem is expressed in terms of Bell polynomials. To illustrate the method, some numerical examples are presented. For these examples, the Bell solutions and the absolute error functions are calculated, and the results are shown in tables and figures for comparison with the exact solutions. 2026-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7157 On ψ- criticality of some random graphs Kokiladevi, Selvakumar; Yegnanarayanan, Venkataraman; Rajermani, Thinakaran A vertex colouring g of a graph G is said to be pseudocomplete if for any two distinct colours i, j there exists at least one edge e = (u, v) ∈ E(G) such that g(u) = i and g(v) = j. The maximum number of colors used in a pseudocomplete coloring is called the pseudoachromatic number ψ(G) of G. A Graph G is called vertex ψ-critical if ω(G) = 2ψ(G) − |V (G)|. If P* is a criticality property with respect to ψ then we have obtained some interesting results related to the random graphs as process innovation. We also proved that there is positive probability for the existence of a large collection of family of graphs that are not critical. We also listed a number of open problems. 2026-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/7156 On controllability results for fuzzy Caputo-Katugampola fractional differential equations Hariharan, Ramaraj; Udhayakumar, Ramalingam This article explores the controllability of fuzzy fractional differential equations using the Caputo-Katugampola fractional derivative. First, we prove the existence of a mild solution using fractional calculus, fuzzy set theory, semigroup theory, and the Caputo-Katugampola fractional derivative. The main results are obtained through a fixed-point theorem. Finally, we illustrate our findings with an example. 2016-01-01T00:00:00Z