Search results
Results from the WOW.Com Content Network
A planar graph is said to be convex if all of its faces (including the outer face) are convex polygons. Not all planar graphs have a convex embedding (e.g. the complete bipartite graph K 2,4). A sufficient condition that a graph can be drawn convexly is that it is a subdivision of a 3-vertex-connected planar graph.
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 ...
A planar chiral derivative of ferrocene, used for kinetic resolution of some racemic secondary alcohols [1]. This term is used in chemistry contexts, [2] e.g., for a chiral molecule lacking an asymmetric carbon atom, but possessing two non-coplanar rings that are each dissymmetric and which cannot easily rotate about the chemical bond connecting them: 2,2'-dimethylbiphenyl is perhaps the ...
A chemical graph is a labeled graph whose vertices correspond to the atoms of the compound and edges correspond to chemical bonds. Its vertices are labeled with the kinds of the corresponding atoms and edges are labeled with the types of bonds. [1] For particular purposes any of the labelings may be ignored. A hydrogen-depleted molecular graph ...
In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph ...
[1] [4] Alternatively, if it is expected that the planar subgraph will include almost all of the edges of the given graph, leaving only a small number k of non-planar edges for the incremental planarization process, then one can solve the problem exactly by using a fixed-parameter tractable algorithm whose running time is linear in the graph ...
Structure of cisplatin, an example of a molecule with the square planar coordination geometry. In chemistry, the square planar molecular geometry describes the stereochemistry (spatial arrangement of atoms) that is adopted by certain chemical compounds. As the name suggests, molecules of this geometry have their atoms positioned at the corners.
A 1-planar graph is said to be an optimal 1-planar graph if it has exactly 4n − 8 edges, the maximum possible. In a 1-planar embedding of an optimal 1-planar graph, the uncrossed edges necessarily form a quadrangulation (a polyhedral graph in which every face is a quadrilateral). Every quadrangulation gives rise to an optimal 1-planar graph ...