Bulletin of the International Mathematical Virtual Institute

203-212

Authors: Dilek Bayrak and Sultan Yamak

In this paper, we investigated concept of TL-vague module and obtained some basic properties of this concept.

221-231

Authors: Murat Düz

In this study, second order linear complex differential equations are solved by the Adomian decomposition method. A theorem is given for this method. Furthermore some examples are given, and the results obtained indicate this approach is indeed practical.

245-258

Authors: R. Ponraj, M. Maria Adaickalam and R. Kala

Path, complete graph, difference cordial, corona

271--278

Authors: Aysun Ayatac and Betul Atay

The assessment of the stability and the vulnerability of complex networks is the important concept while studying of them. In the literature, a sort of measures have been given in order to assessment the stability of systems. And also, some graph-theoretic parameters have been formed to provide formulas which calculate the reliability of a network. In this paper, we study the vulnerability of some cycles and related graphs to the dominating strategy of a vertex, using a measure called exponential domination number which is a new characteristic for graph vulnerability.

287-299

Authors: Waleed Mohd. Alfaqih, Mohammad Imdad, and Rqeeb Gubran

The aim of this paper is to discuss the existence and uniqueness of a common solution for the following system of linear Fredholm integral equations (of the second kind) where beta in R, fi; Ki and Fi are given continuous functions, i = 1; 2 while u is unknown function to be determined. To establish this, we prove a common fixed point theorem for two self-mappings defined on a complex metric space. Moreover, we prove coincidence and common fixed point theorems for two weakly compatible self-mappings defined on a complex metric space.

315-323

Authors: R. Rajkumar and S. Celine Prabha

Let Pn be the path graph on n vertices. In this paper, we consider the distance graphs G(Pn;D), where the distance set D  f1; 2; 3; : : : ; n

337-344

Authors: Fikret Čunjalo

In the [3] is proven that sequence Sij uniformly statistically converges to L if and only if it there is a subset A of the set N  N uniform density zero and subsequence S (x) dened by, Sij (x) = Sij for (i; j) 2 Ac, converges to L, in the Pringsheim's sense. In this paper it is proven that analog is valid for subsequence S (x) provided that for each N and i 6 N _ j 6 N is a set of all Sij (x) nite set. Is generally valid: If the subsequence S (x) uniformly statistically converges to L, then, there is a subset A of the set N  N uniform density zero and subsequence S (y) dened by, Sij (y) = Sij (x) for (i; j) 2 Ac, converges to L, in the Pringsheim's sense. If there is a subset A of the set N  N uniform density zero and subsequence S (y) dened by, Sij (y) = Sij (x) for (i; j) 2 Ac, such that limi!1( limj!1Sij (y)) = L, then, the subsequence S (x) uniformly statistically converges to L.

357-364

Authors: Noorbhasha Rafi and Ravi Kumar Bandaru

The concept of extended ideals in an Almost distributive Lattice is introduced and studied their properties.

369-383

Authors: Ali Ghalavand, Ali Reza Ashra and Ivan Gutman

Let G be a graph with edge set E(G). The second multiplicative Zagreb index of G is defined as 2(G) = Π uv2E(G)[degG(u) degG(v)], where degG(v) is the degree of the vertex v of G. In this paper, the unicyclic graphs with rst through seventh smallest 2

391-396

Authors: Naveen Kumar Kakumanu, G.C. Rao and Kar Ping Shum

In this paper, we introduce the concept of a Factor Almost Distributive Lattice and derive some of its important properties. We also prove that if I is an ideal of B then the Factor Almost Distributive Lattice A=I is a Post Almost Distributive Lattice.