Search results
Arrhenius plot. In chemical kinetics, an Arrhenius plot displays the logarithm of a reaction rate constant, ( , ordinate axis) plotted against reciprocal of the temperature ( , abscissa). [1] Arrhenius plots are often used to analyze the effect of temperature on the rates of chemical reactions. For a single rate-limited thermally activated ...
Arrhenius equation. In physical chemistry, the Arrhenius equation is a formula for the temperature dependence of reaction rates. The equation was proposed by Svante Arrhenius in 1889, based on the work of Dutch chemist Jacobus Henricus van 't Hoff who had noted in 1884 that the van 't Hoff equation for the temperature dependence of equilibrium ...
The Van 't Hoff equation relates the change in the equilibrium constant, Keq, of a chemical reaction to the change in temperature, T, given the standard enthalpy change, ΔrH⊖, for the process. The subscript means "reaction" and the superscript means "standard". It was proposed by Dutch chemist Jacobus Henricus van 't Hoff in 1884 in his book ...
C 6 H 6 (l) 124.5. 31.00. The standard Gibbs free energy of formation of a compound is the change of Gibbs free energy that accompanies the formation of 1 mole of that substance from its component elements, in their standard states (the most stable form of the element at 25 °C and 100 kPa). Its symbol is Δ fG ˚.
Line chart. A line chart or line graph, also known as curve chart, [1] is a type of chart that displays information as a series of data points called 'markers' connected by straight line segments. [2] It is a basic type of chart common in many fields. It is similar to a scatter plot except that the measurement points are ordered (typically by ...
Shortest path problem. Shortest path (A, C, E, D, F) between vertices A and F in the weighted directed graph. In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. [1]
T-coloring. In graph theory, a T-Coloring of a graph , given the set T of nonnegative integers containing 0, is a function that maps each vertex to a positive integer (color) such that if u and w are adjacent then . [1] In simple words, the absolute value of the difference between two colors of adjacent vertices must not belong to fixed set T.
Line graph. In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L (G) that represents the adjacencies between edges of G. L (G) is constructed in the following way: for each edge in G, make a vertex in L (G); for every two edges in G that have a vertex in common, make an edge between their ...