نتایج جستجو برای: commuting graphs
تعداد نتایج: 103441 فیلتر نتایج به سال:
Abstract Let G be a finite group. A number of graphs with the vertex set have been studied, including power graph, enhanced and commuting graph. These form hierarchy under inclusion edge sets, it is useful to study them together. In addition, several authors considered modifying definition these by choosing natural equivalence relation on group such as equality, conjugacy, or equal orders, join...
UNLABELLED This questionnaire study tests cognitive failures as a mediator of the potential influence of mental work demands and conscientiousness on risky commuting. Participants were 104 railway-controllers (19% female). Failure of memory, attention regulation and action execution were assessed with the Workplace Cognitive Failure (WCF) scale. Mental work demands were measured by the Instrume...
We define four 3×3 commuting contractions which do not dilate to commuting isometries. However they do satisfy the scalar von Neumann inequality. These matrices are all nilpotent of order 2. We also show that any three 3×3 commuting contractions which are scalar plus nilpotent of order 2 do dilate to commuting isometries.
The aim of this study was to verify the prevalence of physical inactivity and associated factors among adolescents commuting to school. This was an epidemiological study based on secondary data from a sample of 4,207 adolescents (14-19 years). Data were collected through a previously validated questionnaire (GSHS-WHO). Adolescents were classified as "inactive in commuting" when they reported no...
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects such as entanglement. In this paper we show that the computational power of commuting circuits exhibits a surprisingly rich structure. First we sh...
the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...
Commuting data is increasingly used to describe population mobility in epidemic models. However, there is little evidence that the spatial spread of observed epidemics agrees with commuting. Here, using data from 25 epidemics for influenza-like illness in France (ILI) as seen by the Sentinelles network, we show that commuting volume is highly correlated with the spread of ILI. Next, we provide ...
This paper analyzes the determinants of the perceived stress level of workers with a special focus on the effects of commuting, while controlling for personal and work-related characteristics. Using ordered logistic regression we find that several dimensions of the commuting situation, such as impedance, control and predictability of commuting, significantly influence the perceived stress level...
a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید