en
jalali
1387
8
1
gregorian
2008
11
1
3
2
online
1
fulltext
en
The explicit relation among the edge versions of detour index
The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.
Vertex detour index, Edge detour indices, Molecular graph.
1
12
http://ijmsi.ir/browse.php?a_code=A-10-1-45&slc_lang=en&sid=1
A. Mahmiani
`0031947532846002080`

0031947532846002080
Yes
O. Khormali
`0031947532846002081`

0031947532846002081
No
A. Iranmanesh
`0031947532846002082`

0031947532846002082
No
en
Application of He’s homotopy perturbation method for Schrodinger equation
In this paper, He’s homotopy perturbation method is applied to solve linear Schrodinger equation. The method yields solutions in convergent series forms with easily computable terms. The result show that these method is very convenient and can be applied to large class of problems. Some numerical examples are given to effectiveness of the method.
He’s homotopy perturbation method, Linear Schrodinger equations.
13
19
http://ijmsi.ir/browse.php?a_code=A-10-1-49&slc_lang=en&sid=1
B. Jazbi
`0031947532846002083`

0031947532846002083
Yes
M. Moini
`0031947532846002084`

0031947532846002084
No
en
On Two Methods for Computing the Non-Rigid Group of Molecules
In this paper, two methods are described, by means of which it is possible to calculate the non rigid group of molecules consisting of a number of XH3 groups attached to a rigid framework. The first method is a combination of the wreath product formalism of Balasubramanian and modern computer algebra and the second method is a computational approach by using group theory package GAP. We apply these methods on 2,3,6,7,10,11-hexanitrotriphenylene (HNT) to compute its non-rigid group.
Non-rigid group, the Computer Algebra System GAP, Character table, HNT.
21
28
http://ijmsi.ir/browse.php?a_code=A-10-1-51&slc_lang=en&sid=1
A. Iranmanesh
`0031947532846002085`

0031947532846002085
Yes
A. R. Ashrafi
`0031947532846002086`

0031947532846002086
No
en
Some result on simple hyper K-algebras
A simple method is described, to prove some theorems for simple hyper K-algebras and to study positive implicative hyper K-ideals, weak (implicative ) hyper K-ideals in simple hyper K-algebras . Beside, some results on positive implicative and (weak) implicative simple hyper K-algebras are presented. Finally classification of simple hyper Kalgebras of order 4, which are satisfied in conditions of Theorem 3.29, is going to be calculated .
Hyper K-algebra, Simple hyper K-algebra, (weak)Hyper K-ideal, Positive implicative hyper K-ideal, (weak) Implicative hyper K-ideal.
29
48
http://ijmsi.ir/browse.php?a_code=A-10-1-52&slc_lang=en&sid=1
T. Roudbari
`0031947532846002087`

0031947532846002087
Yes
M. M. Zahedi
`0031947532846002088`

0031947532846002088
No
en
Quasi-Exact Sequence and Finitely Presented Modules
The notion of quasi-exact sequence of modules was introduced by B. Davvaz and coauthors in 1999 as a generalization of the notion of exact sequence. In this paper we investigate further this notion. In particular, some interesting results concerning this concept and torsion functor are given.
Quasi-exact sequence, Finitely presented module, Torsion functor.
49
53
http://ijmsi.ir/browse.php?a_code=A-10-1-46&slc_lang=en&sid=1
A. Madanshekaf
`0031947532846002089`

0031947532846002089
Yes
en
The Polynomials of a Graph
In this paper, we are presented a formula for the polynomial of a graph. Our main result is the following formula: [Sum (d{_u}(k))]=[Sum (a{_kj}{S{_G}^j}(1))], where, u is an element of V(G) and 1<=j<=k.
Graph, Polynomial, Graphical sequence.
55
67
http://ijmsi.ir/browse.php?a_code=A-10-1-48&slc_lang=en&sid=1
S. Sedghi
`0031947532846002090`

0031947532846002090
Yes
N. Shobe
`0031947532846002091`

0031947532846002091
No
M. A. Salahshoor
`0031947532846002092`

0031947532846002092
No
en
Median and Center of Zero-Divisor Graph of Commutative Semigroups
For a commutative semigroup S with 0, the zero-divisor graph of S denoted by ;Gamma(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study median and center of this graph. Also we show that if Ass(S) has more than two elements, then the girth of ;Gamma(S) is three.
Commutative semigroup, Zero-divisor graph, Center of a graph, Median of a graph.
69
76
http://ijmsi.ir/browse.php?a_code=A-10-1-50&slc_lang=en&sid=1
H. R. Maimani
`0031947532846002095`

0031947532846002095
Yes
en
Superminimal fibres in an almost contact metric submersion
The superminimality of the fibres of an almost contact metric submersion is used to study the integrability of the horizontal distribution and the structure of the total space.
Almost contact metric submersion, Almost contact metric manifold, Superminimal submanifold, Riemannian submersions.
77
88
http://ijmsi.ir/browse.php?a_code=A-10-1-47&slc_lang=en&sid=1
T. Tshikuna-Matamba
`0031947532846002094`

0031947532846002094
Yes