Search results
Results from the WOW.Com Content Network
The radius ratio rule defines a critical radius ratio for different crystal structures, based on their coordination geometry. [1] The idea is that the anions and cations can be treated as incompressible spheres, meaning the crystal structure can be seen as a kind of unequal sphere packing .
An octahedron may then form with a radius ratio greater than or equal to 0.414, but as the ratio rises above 0.732, a cubic geometry becomes more stable. This explains why Na + in NaCl with a radius ratio of 0.55 has octahedral coordination, whereas Cs + in CsCl with a radius ratio of 0.93 has cubic coordination.
Template: Atomic radius. ... Download as PDF; Printable version; In other projects ... This page was last edited on 31 May 2023, at 19:41 (UTC).
Ionic radius, r ion, is the radius of a monatomic ion in an ionic crystal structure. Although neither atoms nor ions have sharp boundaries, they are treated as if they were hard spheres with radii such that the sum of ionic radii of the cation and anion gives the distance between the ions in a crystal lattice .
This constraint removes one degree of freedom from the choices of (originally) six free bond angles to leave only five choices of bond angles. (The angles θ 11 , θ 22 , θ 33 , and θ 44 are always zero and that this relationship can be modified for a different number of peripheral atoms by expanding/contracting the square matrix.)
Hume-Rothery rules, named after William Hume-Rothery, are a set of basic rules that describe the conditions under which an element could dissolve in a metal, forming a solid solution. There are two sets of rules; one refers to substitutional solid solutions, and the other refers to interstitial solid solutions.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
The spectral radius of a finite graph is defined to be the spectral radius of its adjacency matrix. This definition extends to the case of infinite graphs with bounded degrees of vertices (i.e. there exists some real number C such that the degree of every vertex of the graph is smaller than C). In this case, for the graph G define: