We say that two graphs G1 and G2 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 Kn, 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 size n; and if this bound occurs, then there...

A stressful nature of exposure to traffic congestion in automobile commuting has been demonstrated in previous quasi-experimental research that has been measurement-intensive but conducted with relatively small samples. The present study examined commuting stress in automobile travel with a large representative sample (N = 2591) in southern California through telephone survey° Commuting stress ...