Skip to main content

4 Result(s)

within A. Iranmanesh Remove this filter Mathematics of Computing Remove this filter

and

  1. No Access

    Article

    Topological efficiency under graph operations

    In this paper we present explicit formulas for computing the topological efficiency index of the most important graph operations such as the Cartesian product, composition, corona, join and hierarchical produc...

    S. Hossein-Zadeh, A. Iranmanesh… in Journal of Applied Mathematics and Computi… (2017)

  2. No Access

    Article

    Generalized latin square

    LetX be a n-set and letA = [aij] be an xn matrix for whichaij ⊆X, for 1 ≤i, j ≤n. A is called a generalized Latin square onX, if the following conditions is satisfied:

    A. Iranmanesh, A. R. Ashrafi in Journal of Applied Mathematics and Computing (2006)

  3. No Access

    Article

    A new characterization ofA p wherep andp − 2 are primes

    Based on the prime graph of a finite simple group, its order is the product of its order components (see [4]). It is known that Suzuki-Ree groups [6],PSL 2(q) [8] andE 8(q) [7] are...

    A. Iranmanesh, S. H. Alavi in Korean Journal of Computational and Applied Mathematics (2001)

  4. No Access

    Article

    Minimal generalized permutations

    In this paper, we obtain the number of the minimal generalized permutations on a finite set. Also, we determine the minimal generalized permutations on a setX of cardinality less than or equal to 4.

    A. Iranmanesh, A. Faghihi in Korean journal of computational & applied mathematics (2000)