Search results
Results from the WOW.Com Content Network
A dipole graph containing n edges is called the size-n dipole graph, and is denoted by D n. The size-n dipole graph is dual to the cycle graph C n. The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph D 3, while the diamond crystal as an abstract graph is the maximal abelian covering graph of D 4.
This is a list of graph theory topics, by Wikipedia page. ... Dipole graph; Directed acyclic graph ... Scale-free network; Snark (graph theory)
Dipole graph, a graph with two poles; Dipole speaker, a loudspeaker enclosure; Dipole model of the Earth's magnetic field, a first order approximation of the rather complex true Earth's magnetic field (which can be viewed as dipolar) Dipole anisotropy, the progressive difference in the frequency of radiation from opposite directions due to the ...
In an S node, the associated graph is a cycle graph with three or more vertices and edges. This case is analogous to series composition in series–parallel graphs; the S stands for "series". [3] In a P node, the associated graph is a dipole graph, a multigraph with two vertices and three or more edges, the planar dual to a cycle graph
The size of the induced dipole moment is equal to the product of the strength of the external field and the dipole polarizability of ρ. Dipole moment values can be obtained from measurement of the dielectric constant. Some typical gas phase values given with the unit debye are: [7] carbon dioxide: 0; carbon monoxide: 0.112 D; ozone: 0.53 D
You are free: to share – to copy, distribute and transmit the work; to remix – to adapt the work; Under the following conditions: attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made.
Schläfli graph; Semi-symmetric graph; Shrikhande graph; Shuffle-exchange network; Snark (graph theory) Strongly regular graph; Sudoku graph; Supersingular isogeny graph; Suzuki graph; Sylvester graph; Symmetric graph; Szekeres snark
Dinatural transformation-- Dini continuity-- Dini criterion-- Dini derivative-- Dini–Lipschitz criterion-- Dini test-- Dini's surface-- Dini's theorem-- Dinic's algorithm-- Dining cryptographers problem-- Dining philosophers problem-- Dinitz conjecture-- Dinostratus' theorem-- Diophantine approximation-- Diophantine equation-- Diophantine ...