Bulletin of the International Mathematical Virtual Institute

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.