A. Mohammadian

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We say that two graphs G 1 and G 2 with the same vertex set commute if their adjacency matrices commute. In this paper, we find all integers n such that the complete bipartite graph K n, n is decomposable into commuting perfect matchings or commuting Hamilton cycles. We show that there are at most n−1 linearly independent commuting adjacency matrices of(More)
  • 1