A numerical method consists of combining Haar basis method and Tikhonov regularization method. We apply the method to solve some inverse problems for twodimensional parabolic and hyperbolic equations using noisy data. In ...

The main purpose of this paper is to give the extent idea which was introduced by R. M. Robinson [5]. One of the interesting application of this extent idea is an investigation of the class of harmonic mappings related to ...

The aim of this paper is to introduce and investigate a new class of harmonic multivalent functions defined by (p,q)-analogue of Ruscheweyh operator for multivalent functions. For this new class, we obtain a (p,q)-coefficient ...

In this paper, we find the harmonious chromatic number of multicopy of complete graphs Kn. We generalize the result ?H ((n + 2)Kn) > n + 1 2 ! given in [8] and also further improve the result to ?H((n + 2)Kn) ? n + 1 2 ! ...

In this paper, we give the notion of interval-valued log–convex functions on the co-ordinates on the rectangle from the plane. We establish Hermite-Hadamard and related inequalities for these classes of functions. Our ...

Let G = (V, E) be a graph with p vertices and q edges. A bijection f : V ?E ? {1, 2, · · · , p+q} is said to be a highly total prime labeling if (i) for each edge e = uv, the labels assigned to u and v are relatively prime ...

We create the homogeneous q-difference operator Ee(a, b; ?) as an extension of the exponential operator E(b?). A new polynomials hn(a, b, x|q?1) are defined as an extension of the q?1-Rogers-Szegö polynomial hn(a, b|q?1). ...

Explicit expressions of the Hosoya polynomials of some classes of graphs are known. In this paper we find an explicit expression for the Hosoya polynomial of the multibridge graph. Finally we give some examples of multi-bridge ...

A hub set in a graph G is a set S ? V (G) such that any two vertices outside S are connected by a path whose all internal vertices are members of S. The minimum cardinality of hub set is called hub number. In this paper, ...

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we introduce a ...