For the numerical solution of the singularly perturbed parabolic convection- difusion equation with large time delays, a novel class of fitted operator finite difference method is constructed using the Mickens-type scheme. ...

The main object of this paper is to study classes of analytic function associated with generalized Struve functions and using (p, q)–Jackson derivative. Furthermore, the bounds for generalized distribution using subordination ...

This paper gives the construction and analysis of a new numerical method to solve variable order time fractional mobile-immobile transport model. The proposed numerical method is based on Crank-Nicolson approach with fourth ...

In this paper, we prove Wt □ G and Wt ⊠ G are not distance magic if graph G contains two vertices with the same neighborhood. And we also prove Wt × C4 (t ≥ 5), W3□Pn and W4 × Pn (n ≥ 3) are not distance magic graphs.

In this paper, we present a fitted numerical scheme for singularly perturbed delay differential equations with integral boundary conditions. To develop the scheme, the exact and approximate rules of integration with finite ...

The concept of a fuzzy biatomic pair in a fuzzy lattice is introduced. Characterizations of a fuzzy biatomic pair in fuzzy lattices are obtained in terms of a fuzzy modular pair.

This paper focuses on the fractional Schr¨odinger problem with the use of a new fractional derivative. Using Banach’s fixed point theorem and Laplace transforms, we give and prove the integral solution of the problem. In ...

A graph with directed edges is referred to be directed graph. It is possible to study and resolve problems with social connections, shortest paths, electrical circuits, etc. using directed graphs. D. Molodtsov proposed ...

This paper aims to present the associated results of holomorphic function J(z) := Jµ,δ(p, q; r; z) defined on open unit disc U = {z ∈ C : |z| < 1}, belongs to ϕ* (A, B) and K(A, B). This work also consider an integral ...

The middle graph M(G) of a graph G is an intersection graph on the vertex set V (G) of any graph G. Let E(G) be an edge set of G and F = V’ (G) ∪ E(G), where V’ (G) indicates the family of all one vertex subsets of the set ...