INTRODUCTION Active commuting is associated with a reduced risk of several chronic diseases, but few studies have considered institutional factors that influence it. We examined the association between cultural and physical workplace supports for active commuting and employee active commuting behavior. METHODS Data were collected from employees (N = 375) in Manhattan, Kansas, via an online su...

We say that two graphs G and H with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number r, the complete multigraphK n is decomposable into commuting perfect matchings if and only if n is a 2-power. Also, it is shown that the complete graph Kn is decomposable into commuting Hamilton cycles if and only if n is a prime number. © 200...

BACKGROUND Most public transit users walk to and from transit. We analyzed the relationship between transit commuting and objectively measured physical activity. METHODS Adults aged 20 to 65 working outside the home (n = 1237) were randomly selected from neighborhoods in Seattle and Baltimore regions. Neighborhoods had high or low median income and high or low mean walkability. Mean daily min...

‎‎let r be a non-commutative ring with unity‎. ‎the commuting graph‎ ‎of $r$ denoted by $gamma(r)$‎, ‎is a graph with a vertex set‎ ‎$rsetminus z(r)$ and two vertices $a$ and $b$ are adjacent if and only if‎ ‎$ab=ba$‎. ‎in this paper‎, ‎we investigate non-commutative rings with unity of order $p^n$ where $p$ is prime and $n in lbrace 4,5 rbrace$‎. it is shown that‎, ‎$gamma(r)$ is the disjoint ...

We present a survey of an open problem concerning the dimension of the algebra generated by three commuting matrices. This article concerns a problem in algebra that is completely elementary to state, yet, has proven tantalizingly difficult and is as yet unsolved. Consider C[A,B,C] , the C-subalgebra of the n × n matrices Mn(C) generated by three commuting matrices A, B, and C. Thus, C[A,B,C] c...

‎Let $G$ be a finite non-abelian group with center $Z(G)$‎. ‎The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$‎. ‎In this paper‎, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups‎..

We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n) output qubits, where a quantum circuit is classically simulatable if its output probability distribution can be sampled up to an exponentially small additive error in classical polynomial time. First, we show that there exists a commuting quantum circuit that is not classically simulatable unles...

The purpose of this paper is to prove some theorems which generalize a theorem of M. Tel ci, K. Tas and B. Fisher on compatible mappings and compatible mappings of type (A). Let S, T be two self-mappings of a metric space (X; d). Sessa 7] deenes S and T to be weakly commuting if d(STx; TSx) 6 d(Tx; Sx) for all x in X. Jungck 3] deenes T and S to be compatible ii lim n d(STx n ; TSx n) = 0 whene...