Bulletin of the International Mathematical Virtual Institute

115-124

Authors: Pankaj Kumar Jhade , A.S. Saluja and M.S.Khan

Let C be a closed convex weakly Cauchy subset of a normed space X. Then we dene new fa; b; cg-type generalized nonexpansive mapping and fa; b; cg-type generalized contraction mapping T from C into C. These type of mappings will be denoted respectively by fa; b; cg-gntype and fa; b; cg-gctype. The aim of this paper is to establish some strong convergence results for such type of mappings. Our results extends and generalizes some of the results given in [2].

133-140

Authors: Duško Bogdanić

In this paper we show that tame blocks of group algebras with semidihedral defect groups and two isomorphism classes of simple modules can be non-trivially graded. We prove this by using the transfer of gradings via derived equivalences.

153--158

Authors: J.Chithra, S.P.Subbiah and V.Swaminathan

Adin and Roichman introduced the concept of permutation graphs and Peter Keevash, Po-Shen Loh and Benny Sudakov identified some permutation graphs with maximum number of edges. Charles J Colbourn, Lorna K.Stewart characterized the connected domination and Steiner Trees under the Permutation graphs. If i, j belong to a permutation  on p symbols A = {1, 2, , p} and i < j then the line of i crosses the line of j in the permutation if i appears after j in the image sequence s() and if the no. of crossing lines of i is less than the no. of crossing lines of j then i strongly dominates j. A subset D of A, whose closed neighborhood is A in  is a dominating set of . D is a strong dominating set of  if every i in A−D is strongly dominated by some j in D. In this paper the strong number of a permutation is investigated by means of crossing lines.

165-169

Authors: Daniel A. Romano

In article [4], quasi-regular relations and dually quasi-regular re- lations on sets are introduced and analyzed. In this paper, following Jiang Guanghao and Xu Luoshan's concepts of finitely conjugative and finitely dual normal relations on sets, the concept of finitely dual quasi-regular relations is introduced, as a continuation of [4]. Characterizations of finitely dual quasi- regular relations are obtained.

181-190

Authors: R. Ponraj and S.Sathish Narayanan

A total mean cordial labeling of a graph G = (V,E) is a function f : V (G) ! {0, 1, 2} such that for each edge xy assign the label l f(x)+f(y) 2 m where x, y 2 V (G) and  evf (i) − evf (j) 6 1, i, j 2 {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If there exists a total mean cordial labeling on a graph G, we will call G is total mean cordial. In this paper, we investigate the total mean cordial labeling behavior of some derived graphs.

197-204

Authors: Puttaswamy and Mohammed Alatif

Let G = (V;E) be a connected graph, A subset S of E(G) is called a boundary edge dominating set if every edge of E

13-23

Authors: Sabbavarapu Nageswara Rao

We determine intervals for two eigenvalues for which there exists no positive solution of a system of nonlinear higher-order ordinary differential equations (

33-36

Authors: Igor Milovanović and Emina Milovanović

We have dened a new class of convex sequences, referred to as Lkp -convex sequences. These sequences represent generalization of a class of k-convex sequences, k > 2. Some important properties of Lkp -convex sequences are proved.

47-55

Authors: N. Rafi, Ravi Kumar Bandaru and G.C. Rao

In this paper two kinds of congruences are proposed in an Almost distributive lattice(ADL), rst one is considered in terms of ideals generated by derivations and second one is followed by in terms of images of derivations. An equivalent condition is derived for the corresponding quotient ADL to become a Boolean algebra. An another equivalent condition is also established for the existence of a derivation.

65-72

Authors: Mukaddes Ökten Turaci and Turgut Özis

Recently, the Runge-Kutta methods, obtained via Taylor's expan- sion is exist in the literature. In this study, we have derived explicit methods for problems of the form y0 = f(y) including second and third derivatives , by considering available Two-Derivative Runge-Kutta methods (TDRK). The methods use one evaluation of rst derivative, one evaluation of second de- rivative and many evaluations of third derivative per step. The methods can be named as Three- Derivative Runge-Kutta methods, ThDRK shortly. We present methods with stages up to three and order up to seven. Comparisons is made with other some existing methods on some standard problems. The stability region of the methods are given.

81-88

Authors: K.M.Dharmalingam, R.Udaya Suriya and P.Nithya

Let G be a fuzzy graph. Let u and v be two vertices of G. A subset D of V is called a fuzzy equitable dominating set if every v 2 V

95-102

Authors: Vecdi Aytac and Sema Bodur

Vulnerability concerns the issue of network robustness to mali- cious attacks. Many complex systems in the real world can be conceptually described as networks, where nodes represent the system constituents and edges depict the interaction between them. Often enough, the network rep- resentation of these systems is an undirected and unweighted graph which greatly simplies the structure of complex systems. If we think of a graph as modeling a network, then we have some graph parameters to measure the vulnerability, including connectivity, toughness, binding number, domination number and integrity. In this paper, we consider the integrity and strong dom- ination numbers as vulnerability measures. We determine the integrity and strong domination numbers of splitting graphs S′(G) for specic graphs G.