2026-10-14T04:30:37+03:30 http://ijmsi.ir/browse.php?mag_id=32&slc_lang=en&sid=1

32-1033 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 W.-Ch. Shiu wcshiu@hkbu.edu.hk G.-Ch. Lau geeclau@yahoo.com H.-K. Ng ho-kuen.ng@sjsu.edu Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(e')$ for any two adjacent edges $e$ and $e'$. Denote by $mu'(G)$ the minimum $k$ for $G$ to admit an edge-coloring $k$-vertex weightings. In this paper, we determine $mu'(G)$ for some classes of graphs. Edge coloring Vertex weightings. 2021 4 01 1 13 http://ijmsi.ir/article-1-1033-en.pdf

32-1188 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 M. kimiaei kimiaeim83@univie.ac.at H. esmaeili esmaeili47@yahoo.com F. rahpeymaii rahpeyma_83@yahoo.com In this paper, we present a nonmonotone trust-region algorithm for unconstrained optimization. We first introduce a variant of the nonmonotone strategy proposed by Ahookhosh and Amini cite{AhA 01} and incorporate it into the trust-region framework to construct a more efficient approach. Our new nonmonotone strategy combines the current function value with the maximum function values in some prior successful iterates. For iterates far away from the optimizer, we give a very strong nonmonotone strategy. In the vicinity of the optimizer, we have a weaker nonmonotone strategy. It leads to a medium nonmonotone strategy when iterates are not far away from or close to the optimizer. Theoretical analysis indicates that the new approach converges globally to a first-order critical point under classical assumptions. In addition, the local convergence is also studied. Extensive numerical experiments for unconstrained optimization problems are reported. Unconstrained optimization Trust-region framework Nonmonotone technique Theoretical convergence 2021 4 01 15 33 http://ijmsi.ir/article-1-1188-en.pdf

32-1220 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 E. Nazari e.nazari@modares.ac.ir A. Heydari aheydari@modares.ac.ir In this paper, we will study compatible triples on Lie algebroids. Using a suitable decomposition for a Lie algebroid, we construct an integrable generalized distribution on the base manifold. As a result, the symplectic form on the Lie algebroid induces a symplectic form on each integral submanifold of the distribution. The induced Poisson structure on the base manifold can be represented by means of the induced Poisson structures on the integral submanifolds. Moreover, for any compatible triple with invariant metric and admissible almost complex structure, we show that the bracket annihilates on the kernel of the anchor map. Lie algebroid Symplectic Lie algebroid Contact Lie algebroid Poisson structure 2021 4 01 35 53 http://ijmsi.ir/article-1-1220-en.pdf

32-1172 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 E. Dundar edundar@aku.edu.tr F. Nuray fnuray@aku.edu.tr U. Ulusu ulusu@aku.edu.tr In this paper, we study the concepts of Wijsman statistical convergence, Hausdorff statistical convergence and  Wijsman statistical Cauchy double sequences of sets and investigate the relationship between them. Statistical convergence Double sequence of sets Wijsman convergence Hausdorff convergence. 2021 4 01 55 64 http://ijmsi.ir/article-1-1172-en.pdf

32-1284 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 R. Mohammadi rasool.mohammadi@modares.ac.ir We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of minimum distance in several cases and get many records that don’t exist in MinT tables (tables of optimal parameters for linear codes), such as codes over F72 of dimension less than 36. Moreover, using maximal Hermitian curves and their sub-covers, we obtain a necessary and sufficient condition for self-orthogonality and Hermitian self-orthogonally of CL(D, G). Algebraic geometric codes Maximal curves Minimum distance Goppa bound Quantum error-correcting codes 2021 4 01 65 76 http://ijmsi.ir/article-1-1284-en.pdf

32-1275 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 B. -N. Guo bai.ni.guo@hotmail.com F. Qi qifeng618@gmail.com In the paper, the authors view some ordinary differential equations and their solutions from the angle of (the generalized) derivative polynomials and simplify some known identities for the Bernoulli numbers and polynomials, the Frobenius-Euler polynomials, the Euler numbers and polynomials, in terms of the Stirling numbers of the first and second kinds. Viewpoint Ordinary differential equation Solution Derivative polynomial Identity Stirling numbers Bernoulli number Bernoulli polynomial Frobenius-Euler polynomial 2021 4 01 77 95 http://ijmsi.ir/article-1-1275-en.pdf

32-1251 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 A. Kourehpaz asma_korehpaz@jsu:ac:ir R. Nikandish r.nikandish@jsu.ac.ir Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either Eulerian or Hamiltonian are given. Annihilating-ideal graph Eulerian graphs Hamiltonian graphs 2021 4 01 97 104 http://ijmsi.ir/article-1-1251-en.pdf

32-1274 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 A. Sadeghian a_sadeghian@stu.yazd.ac.ir S. A.l Shahzadeh Fazeli fazeli@yazd.ac.ir S. M. Karbassi smkarbassi@yazd.ac.ir Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members in each cluster. In this paper, we use hierarchical SVD to cluster graphs with it's adjacency matrix. In this algorithm, users can select a range for the number of members in each cluster. The results show in hierarchical SVD algorithm, clustering measurement parameters are more desirable and clusters are as dense as possible. The complexity of this algorithm is less than the complexity of SVD clustering method. Graph Clustering Singular Value Decomposition Hierarchical Clustering Selectable Clusters Number. 2021 4 01 105 121 http://ijmsi.ir/article-1-1274-en.pdf

32-1256 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 M. Karacan murat.karacan@usak.edu.tr A. Çakmak acakmak@beu.edu.tr S. Kızıltuğ skiziltug@erzincan.edu.tr H. Es hasanes@gazi.edu.tr In this paper, we classify surface at a constant distance from the edge of regression on translation surfaces of Type 1 in the three dimensional simply isotropic space I^1_3 satisfying some algebraic equations in terms of the coordinate functions and the Laplacian operators with respect to the first, the second and the third fundamental form of the surface. We also give explicit forms of these surfaces. Simply isotropic space Translation surfaces Surface at a constant distance from the edge of regression on a surface. 2021 4 01 123 135 http://ijmsi.ir/article-1-1256-en.pdf

32-1273 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 S. S. Salehi Amiri salehisss@baboliau.ac.ir A.R. Khalili Asboei khaliliasbo@yahoo.com Let $G$ be a finite group. The main supergraph $mathcal{S}(G)$ is a graph with vertex set $G$ in which two vertices $x$ and $y$ are adjacent if and only if $o(x) mid o(y)$ or $o(y)mid o(x)$. In this paper, we will show that $Gcong L_{2}(q)$ if and only if $mathcal{S}(G)cong mathcal{S} (L_{2}(q))$, where $q$ is a prime power. This work implies that Thompson's problem holds for the simple group $L_{2}(q)$. Graph Main supergraph Thompson's problem 2021 4 01 137 144 http://ijmsi.ir/article-1-1273-en.pdf

32-1266 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 R. Pourgholi pourgholi@du.ac.ir A. Tahmasbi tahmasbi@du.ac.ir R. Azimi r.azimi@std.du.ac.ir In this work, the convection-diffusion integro-differential equation with a weakly singular kernel is discussed. The  Legendre spectral tau method is introduced for finding the unknown function. The proposed method is based on expanding the approximate solution as the elements of a shifted Legendre polynomials. We reduce the problem to a set of algebraic equations by using operational matrices. Also the convergence analysis for  shifted Legendre polynomials and error estimation for tau method have been discussed and approved with the exact solution. Finally, several numerical examples are given to demonstrate the high accuracy of the method. Shifted Legendre tau method Weakly singular kernel Integro-differential equation Convection-diffusion equation. 2021 4 01 145 168 http://ijmsi.ir/article-1-1266-en.pdf

32-1079 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 F. Dehghani Zadeh dehghanizadeh@iauyazd.ac.ir M. Jahangiri mjahangiri@ipm.ir Let $M$ and $N$ be two finitely generated graded modules over a standard graded Noetherian ring $R=bigoplus_{ngeq 0} R_n$. In this paper we show that if $R_{0}$ is semi-local of dimension $leq 2$ then, the set $hbox{Ass}_{R_{0}}Big(H^{i}_{R_{+}}(M,N)_{n}Big)$ is asymptotically stable for $nrightarrow -infty$ in some special cases. Also, we study the torsion-freeness of graded generalized local cohomology modules $H^{i}_{R_{+}}(M,N)$. Finally, the tame loci $T^{i}(M,N)$ of $(M,N)$ will be considered and some sufficient conditions are proposed for the openness of these sets in the Zariski topology. Graded modules Generalized local cohomology modules Associated prime ideals Tame loci. 2021 4 01 169 180 http://ijmsi.ir/article-1-1079-en.pdf

32-1198 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 M. Ziaaddini ma.ziyaaddini@stu.um.ac.ir A. Erfanian erfanian@um.ac.ir Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or outerplanar. Non-normal graph Relative Non-normal graph Normality degree Outer planar. 2021 4 01 181 189 http://ijmsi.ir/article-1-1198-en.pdf

32-1287 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 S. M. Robati sajjad.robati@gmail.com In this paper, we study the structure of nite Frobenius groups whose non-rational or non-real irreducible characters are linear. Frobenius groups Rational groups Real groups. 2021 4 01 191 194 http://ijmsi.ir/article-1-1287-en.pdf

32-1234 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 H. Budak hsyn.budak@gmail.com F. Usta fuatusta@duzce.edu.tr M. Z. Sarikaya sarikaymz@gmail.com In this paper, we have obtained weighted versions of Ostrowski, Čebysev and Grüss type inequalities for conformable fractional integrals which is given by Katugompola. By using the Katugampola definition for conformable calculus, the present study confirms previous findings and contributes additional evidence that provide the bounds for more general functions. Ostrowski inequality Čebysev inequality Grüss inequality Conformable fractional integrals. 2021 4 01 195 212 http://ijmsi.ir/article-1-1234-en.pdf

32-2172 2026-10-14 10.1002

Iranian Journal of Mathematical Sciences and Informatics IJMSI 1735-4463 2008-9473 10.66224/ijmsi 2021 16 1 The Name of Authors in this Volume fatemeh.bardestani@gmail.com Please see the full text contains the pesian abstracts of this volume. ABSTRACTS PERSIAN Vol. 16 No. 1 2021 4 01 213 228 http://ijmsi.ir/article-1-2172-en.pdf