Mehdi Aaghabali
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mehdi Aaghabali has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Saieed Akbari
Sharif University of Technology
2 shared publications - Klas Markström
Umeå Universitet Umeå Sweden
1 shared publication - Mai Hoang Bien
Faculty of Mathematics and Computer Science, University of Science
1 shared publication S. Akbari
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
1 shared publication- Shmuel Friedland
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, USA
1 shared publication Z. Tajfirouz
Department of Mathematics, University of Zanjan, Zanjan, Iran
1 shared publication
Latest Publications
- Open Access
- 3 October 2017
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 21 (4) , 807-816
Division Algebras with Left Algebraic Commutators
- 3 October 2017
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 21 (4) , 807-816
Open AccessDivision Algebras with Left Algebraic Commutators
- Open Access
Remarks on Vector Space Generated by the Multiplicative Commutators of a Division Ring
Let D be a division ring with centre F. Let T(D) be the vector space over F generated by all multiplicative commutators in D. In [1], authors have conjectured that every division ring is generated as a vector space over its centre by all of its multiplicative commutators. In this note it is shown that if D is centrally finite, then the conjecture holds.
Open AccessRemarks on Vector Space Generated by the Multiplicative Commutators of a Division Ring
Let D be a division ring with centre F. Let T(D) be the vector space over F generated by all multiplicative commutators in D. In [1], authors have conjectured that every division ring is generated as a vector space over its centre by all of its multiplicative commutators. In this note it is shown that if D is centrally finite, then the conjecture holds.
- 6 April 2016
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 65 (1) , 204-209
Order of the largest Sachs subgraphs in graphs
Let G be a graph. A subgraph H of G is called a Sachs subgraph if each component of H is either a copy of or a 2-regular subgraph of G. The order of the largest Sachs subgraph of G is called the perrank of G. A graph G of order n has full perrank if In this article, we characterize the family of all graphs of order n whose permanents of their adjacency matrices are 1. Then we prove that the line graph of G, L(G), has full perrank, unless G is isomorphic to some special trees.
- 6 April 2016
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 65 (1) , 204-209
Order of the largest Sachs subgraphs in graphs
Let G be a graph. A subgraph H of G is called a Sachs subgraph if each component of H is either a copy of or a 2-regular subgraph of G. The order of the largest Sachs subgraph of G is called the perrank of G. A graph G of order n has full perrank if In this article, we characterize the family of all graphs of order n whose permanents of their adjacency matrices are 1. Then we prove that the line graph of G, L(G), has full perrank, unless G is isomorphic to some special trees.
- Open Access
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on 2n vertices. The upper bound is sharp for n even. For n odd we state a conjecture on a sharp upper bound.
Open AccessUpper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on 2n vertices. The upper bound is sharp for n even. For n odd we state a conjecture on a sharp upper bound.