OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-47-en.pdf
2015-10-26T10:20:15
1
12
10.7508/ijmsi.2008.02.001
Vertex detour index
Edge detour indices
Molecular graph.
A. Mahmiani
1
AUTHOR
O. Khormali
2
AUTHOR
A. Iranmanesh
3
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-51-en.pdf
2015-10-26T10:20:15
13
19
10.7508/ijmsi.2008.02.002
He’s homotopy perturbation method
Linear Schrodinger equations.
B. Jazbi
1
AUTHOR
M. Moini
2
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-53-en.pdf
2015-10-26T10:20:15
21
28
10.7508/ijmsi.2008.02.003
Non-rigid group
the Computer Algebra System GAP
Character table
HNT.
A. Iranmanesh
1
AUTHOR
A. R. Ashrafi
2
AUTHOR
OTHERS_CITABLE
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 .
http://ijmsi.ir/article-1-54-en.pdf
2015-10-26T10:20:15
29
48
10.7508/ijmsi.2008.02.004
Hyper K-algebra
Simple hyper K-algebra
(weak)Hyper K-ideal
Positive implicative hyper K-ideal
(weak) Implicative hyper K-ideal.
T. Roudbari
1
AUTHOR
M. M. Zahedi
2
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-48-en.pdf
2015-10-26T10:20:15
49
53
10.7508/ijmsi.2008.02.005
Quasi-exact sequence
Finitely presented module
Torsion functor.
A. Madanshekaf
1
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-50-en.pdf
2015-10-26T10:20:15
55
67
10.7508/ijmsi.2008.02.006
Graph
Polynomial
Graphical sequence.
S. Sedghi
1
AUTHOR
N. Shobe
2
AUTHOR
M. A. Salahshoor
3
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-52-en.pdf
2015-10-26T10:20:15
69
76
10.7508/ijmsi.2008.02.007
Commutative semigroup
Zero-divisor graph
Center of a graph
Median of a graph.
H. R. Maimani
1
AUTHOR
OTHERS_CITABLE
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.
http://ijmsi.ir/article-1-49-en.pdf
2015-10-26T10:20:15
77
88
10.7508/ijmsi.2008.02.008
Almost contact metric submersion
Almost contact metric manifold
Superminimal submanifold
Riemannian submersions.
T. Tshikuna-Matamba
1
AUTHOR