Search results
Results from the WOW.Com Content Network
This is a list of unsolved problems in chemistry. Problems in chemistry are considered unsolved when an expert in the field considers it unsolved or when several experts in the field disagree about a solution to a problem.
In chemical graph theory and in mathematical chemistry, a molecular graph or chemical graph is a representation of the structural formula of a chemical compound in terms of graph theory. A chemical graph is a labeled graph whose vertices correspond to the atoms of the compound and edges correspond to chemical bonds.
In graph theory, the degree of a vertex is its number of connections. In a chemical graph, the maximum degree of an atom is its valence, and the maximum number of bonds a chemical element can make. For example, carbon's valence is 4. In a chemical graph, an atom is saturated if it reaches its valence.
1 Examples and types of graphs. 2 Graph coloring. ... This is a list of graph theory topics, ... Museum guard problem; Wheel graph; Graph coloring
Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. Topological indices are used for example in the development of quantitative structure-activity relationships (QSARs) in which the biological activity or other properties of molecules are correlated with their chemical structure .
Example Bjerrum plot: Change in carbonate system of seawater from ocean acidification.. A Bjerrum plot (named after Niels Bjerrum), sometimes also known as a Sillén diagram (after Lars Gunnar Sillén), or a Hägg diagram (after Gunnar Hägg) [1] is a graph of the concentrations of the different species of a polyprotic acid in a solution, as a function of pH, [2] when the solution is at ...
Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena. [1] The pioneers of chemical graph theory are Alexandru Balaban, Ante Graovac, Iván Gutman, Haruo Hosoya, Milan Randić and Nenad Trinajstić [2] (also Harry Wiener and others). In 1988, it was ...
Graph homomorphism problem [3]: GT52 Graph partition into subgraphs of specific types (triangles, isomorphic subgraphs, Hamiltonian subgraphs, forests, perfect matchings) are known NP-complete. Partition into cliques is the same problem as coloring the complement of the given graph. A related problem is to find a partition that is optimal terms ...