Mohammad Reza Hooshmandasl

Learn More
The operational matrices of fractional-order integration for the Legendre and Chebyshev wavelets are derived. Block pulse functions and collocation method are employed to derive a general procedure for forming these matrices for both the Legendre and the Chebyshev wavelets. Then numerical methods based on wavelet expansion and these operational matrices are(More)
In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô-Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0, T ] is obtained. By using these basis functions and their stochastic operational matrix, such(More)
A set S ⊆ V of the graph G = (V,E) is called a [1, 2]-set of G if any vertex which is not in S has at least one but no more than two neighbors in S. A set S� ⊆ V is called a [1, 2]-total set of G if any vertex ofG, no matter in S� or not, is adjacent to at least one but not more than two vertices in S�. In this paper we introduce a linear algorithm for(More)
A mixed dominating set for a graph G = (V,E) is a set S ⊆ V ∪ E such that every element x ∈ (V ∪E)\S is either adjacent or incident to an element of S. The mixed domination number of a graphG, denoted by γm(G), is the minimum cardinality of mixed dominating sets ofG and any mixed dominating set with cardinality of γm(G) is called a minimum mixed dominating(More)