Attributes Attribute Document in DTMR The Diagnosing Teachers Multiplicative Reasoning Project (DTMR Project) is an exploratory project working to assess teachers’ reasoning about multiplicative relations among quantities. The domain of multiplicative reasoning includes operations with fractions, decimals, ratios, percents, proportions, linear functions and more advanced topics. These topics ar...

Meadows have been proposed as alternatives for fields with a purely equational axiomatization. At the basis of meadows lies the decision to make the multiplicative inverse operation total by imposing that the multiplicative inverse of zero is zero. Thus, the multiplicative inverse operation of a meadow is an involution. In this paper, we study 'non-involutive meadows', i.e. variants of meadows ...

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 ...

An alternative version of the theory of multiplicative unitaries is presented. Instead of the original regularity condition of Baaj and Skandalis we formulate another condition selecting manageable multiplicative unitaries. The manageability is the property of multiplicative unitaries coming from the quantum group theory. For manageable multiplicative unitaries we reproduce all the essential re...

In this paper, we present the exact formulae for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of graphs in terms of other graph invariants including the Wiener index and Zagreb index. Finally, we apply our results to the multiplicative version of degree distance and the multiplicative version of Gutman index of open and closed fe...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

The aim of this paper is to study the integration of multiplicative preference relation as a preference representation structure in fuzzy multipurpose decision-making problems. Assuming fuzzy multipurpose decision-making problems under di4erent preference representation structures (ordering, utilities and fuzzy preference relations) and using the fuzzy preference relations as uniform representa...

In this paper, we establish integral inequalities of Hermite-Hadamard type for multiplicativelys-preinvex functions. We also obtain some new inequalities involving multiplicative integralsby using some properties of multiplicatively s-preinvex and preinvex functions.