Search Results for ""
921 - 930 of 1434 for Transpose Free Quasi Minimal Residual Me...Search Results
Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...
The de Bruijn constant, also called the Copson-de Bruijn constant, is the minimal constant c=1.1064957714... (OEIS A113276) such that the inequality ...
The de Longchamps circle is defined as the radical circle of the power circles of a given reference triangle. It is defined only for obtuse triangles. It is the complement of ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].
The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...
A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...
The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].
The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...
The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...
...
View search results from all Wolfram sites (56786 matches)

