2019-07-21T11:58:43+04:30
http://ijmsi.ir/browse.php?mag_id=6&slc_lang=en&sid=1
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
The explicit relation among the edge versions of detour index
A. Mahmiani
O. Khormali
A. Iranmanesh
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.
2008
11
01
1
12
http://ijmsi.ir/article-1-47-en.pdf
10.7508/ijmsi.2008.02.001
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
Application of He’s homotopy perturbation method for Schrodinger equation
B. Jazbi
M. Moini
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.
2008
11
01
13
19
http://ijmsi.ir/article-1-51-en.pdf
10.7508/ijmsi.2008.02.002
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
On Two Methods for Computing the Non-Rigid Group of Molecules
A. Iranmanesh
A. R. Ashrafi
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.
2008
11
01
21
28
http://ijmsi.ir/article-1-53-en.pdf
10.7508/ijmsi.2008.02.003
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
Some result on simple hyper K-algebras
T. Roudbari
M. M. Zahedi
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.
2008
11
01
29
48
http://ijmsi.ir/article-1-54-en.pdf
10.7508/ijmsi.2008.02.004
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
Quasi-Exact Sequence and Finitely Presented Modules
A. Madanshekaf
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.
2008
11
01
49
53
http://ijmsi.ir/article-1-48-en.pdf
10.7508/ijmsi.2008.02.005
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
The Polynomials of a Graph
S. Sedghi
N. Shobe
M. A. Salahshoor
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.
2008
11
01
55
67
http://ijmsi.ir/article-1-50-en.pdf
10.7508/ijmsi.2008.02.006
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
Median and Center of Zero-Divisor Graph of Commutative Semigroups
H. R. Maimani
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.
2008
11
01
69
76
http://ijmsi.ir/article-1-52-en.pdf
10.7508/ijmsi.2008.02.007
Iranian Journal of Mathematical Sciences and Informatics
IJMSI
1735-4463
2008-9473
7
2008
3
2
Superminimal fibres in an almost contact metric submersion
T. Tshikuna-Matamba
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.
2008
11
01
77
88
http://ijmsi.ir/article-1-49-en.pdf
10.7508/ijmsi.2008.02.008