Bulletin of the International Mathematical Virtual Institute

109-122

Authors: R. A. Rashwan and H. A. Hammad

In [2, 25] the others dened a tangential property which can be used not only for a single mapping but also for a multi-valued mappings and the concept of subcomatiblity of them. Motivated by the results in [2, 25] we prove common xed point theorems satisfying a contractive conditions for pairs of single and multivalued used D-maps and tangential multivalued mappings of integral inequality.

129-134

Authors: Bishwambhar Roy

In this paper -locally closed sets (introduced by Ekici [6]), t - sets, B-sets have been studied. Using these concepts we have obtained the notions for decomposition of continuity and contra continuity in generalized topological spaces.

145-156

Authors: Vishwanath B. Awati and N. M. Bujurke

Abstract. The paper presents the semi-numerical solution for the magneto- hydrodynamic (MHD) flow due to nonlinear porous shrinking sheet caused by boundary layer of an incompressible viscous flow. The governing partial differ- ential equations of momentum equations are reduced into ordinary differential equation by using a classical similarity transformation along with appropriate boundary conditions. Both nonlinearity and infinite interval demand novel mathematical tools for their analysis. We use fast converging Dirichlet series and Method of stretching of variables for the solution of these nonlinear dif- ferential equations. These methods have the advantages over pure numerical methods for obtaining the derived quantities accurately for various values of the parameters involved at a stretch and also they are valid in much larger parameter domain as compared with HAM, HPM, ADM and the classical numerical schemes. 1.

11-15

Authors: Fatih Destović, Ismet Kalčo and Ramiz Vugdalić

The paper presents a vector Markov process, P(x; t), which form the components of the vector y. The Markov process satisfies the (n + 1)- dimensional Fokker-Planck equation partial whose solution under certain initial and boundary conditions of this presentation and the domain of the nonlinear analysis.

27-35

Authors: P. Siva Kota Reddy and Kavita S Permi

In this paper, we obtained the following switching equivalence characterizations: N()  CMD(), CMD()  MD() and MD()  L(), where N(), CMD(), MD() and L() are neighborhood signed graph, common minimal signed graph, minimal dominating signed graph and line signed graph of complementary signed graph of  respectively.

45-52

Authors: Vishal Gupta and Raman Deep Quadruple Coincidence Point

In this paper, we prove quadruple coincidence point theorems for mixed g-monotone mappings satisfying the compatibility property in partially ordered metric space.

61-67

Authors: Veena Mathad, Ali Mohammed Sahal and Kiran S

Let G be a graph. A total hub set S of G is a subset of V (G) such that every pair of vertices (whether adjacent or nonadjacent) of V

81-88

Authors: R. Rangarajan and Shashikala P.

In the present paper, rst we describe the orthogonality relations between denominator polynomials of [n

123-126

Authors: M.Vinčić and D.A.Romano

The concept of -reflexive semigroups is due to Chacron and Thierrin in 1972. In the present paper we discuss -reflexive semigroups with apartness. We prove some fundamental properties of these semigroups.

135-138

Authors: K. M. Nagaraja, P. Siva Kota Reddy and B. Naveenkumar

In this paper using Simpson's quadrature formula for convex func- tion, the inequality involving ratio of means for four positive arguments proved by Rooin and Hassni (2007) is rened.

149-154

Authors: Kuppusamy Markandan Dharmalingam

Let G = (V;E) be a simple graph. Let D be a dominating set and u 2 D. The edges from u to V

161-164

Authors: Ivan Gutman and Mikhail Goubko

The rst Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. In a recent work [Goubko, MATCH Com- mun. Math. Comput. Chem. 71 (2014), 33{46], it was shown that for a tree with n1 pendent vertices, the inequality M1 > 9 n1

7-13

Authors: Anwar Alwardi and N. D. Soner

A subset D of V (G) is called an equitable dominating set of a graph G if for every v 2 (V

21-27

Authors: K.M.Dharmalingam

Let G = (V;E) be a simple graph. A subset S of V is called an equitable vertex covering of G if for every equitable edge e = uv, either u 2 S or v 2 S. The minimum cardinality of an equitable vertex cover of G ia called the euitable covering number of G and is denoted by e o(G).In this paper results involving in this new parameter are found. Also we introduced the Equitable Packing and Equitable Full sets.

35-47

Authors: A. Adhikari and D.C. Sanyal

A steady three-dimensional Magnetohydrodynamic (MHD) boundary layer viscous flow and heat transfer due to a permeable stretching sheet with prescribed surface heat flux is studied in presence of a uniform applied magnetic field transverse to the flow. Using the implicit finite-difference scheme, known as the Keller-box method, the nonlinear ordinary differential equations are solved. The velocity and temperature profiles, skin friction coefficient and wall temperature are discussed for various parameters.

59-68

Authors: Bernadin Ibrahimpašić

In this paper we give several explicit results on rational approxi- mations of the form j

77-83

Authors: S. V. Siva Rama Raju, I. H. Nagaraja Rao and A. Narasimha Rao

The concept of complementary tree vertex edge dominating set (ctved-set) of a nite, connected graph G is introduced and characterization result for a non empty proper subset of the vertex set V of G to be a ctved-set is obtained. The minimum cardinality of a ctved-set is denoted by ctve(G) and is called as ctved number of G. Bounds for this parameter as well, are obtained. Further, the graphs of order n for which the ctved numbers are 1; 2; n

99-101

Authors: Sunilkumar Hosamani and B. Basavanagoud

In 1998, V.R.Kulli and B.Janakiram posed three problems in Graph Theory Notes of New York, XXXIV. Among the three, solution to one problem is published in Graph Theory Notes of New York LIII, 37-38(2007). In this paper the remaining two problems are solved.

133-140

Authors: Tamas Reti and Ivan Gutman

The rst and second multiplicative Zagreb indices of a graph G are 1(G) = Σ x2V (G) d(x)2 and 2(G) = Σ (x;y)2E(G) d(x) d(y), respectively, where d(x) is the degree of the vertex x. We provide lower and upper bounds for 1 and 2 of a connected graph in terms of the number of vertices, number of edges, and the ordinary, additive Zagreb indices M1 and M2

153-161

Authors: R. Sundareswaran and V. Swaminathan

C.A. Barefoot, et. al. [6] introduced the concept of the integrity of a graph. It is an useful measure of vulnerability and it is defined as follows. I(G) = min fjSj + m(G

167-171

Authors: Ivan Arandjelović and Vesna Mišić

In this paper we define contractive bounded linear operators on partially ordered Haussdorff topological vector space and study theirs basic properties.

185-194

Authors: Pankaj Kumar Jhade and A. S. Saluja

We dene a random iteration scheme and consider its convergence to a common random xed point of two random operators dened on a convex subset of a separable Hilbert space.

205-217

Authors: A. S. Saluja, Mukesh Kumar Jain and Pankaj Kumar Jhade

The aim of the present paper is to introduce the notion of weak semi compatibility and obtain xed point theorems by employing the new notion. The new notion is the proper generalization of semi compatibility and is applicable to compatible and commuting type mappings. Our result generalizes several xed point theorems.

223-234

Authors: Binayak S. Choudhury, Krishnapada Das and Samir Kumar Bhandari

In this paper we introduce and establish a cyclic contraction result in probabilistic 2-metric spaces. A control function has been utilized in our theorem. This result generalizes some existing results in 2-metric spaces. Our result is illustrated with an example.