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