Search Results for ""

The intersection of an ellipse centered at the origin and semiaxes of lengths a and b oriented along the Cartesian axes with a line passing through the origin and point ...

The plane determined by the points x_1, x_2, and x_3 and the line passing through the points x_4 and x_5 intersect in a point which can be determined by solving the four ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

The negative pedal curve of a line specified parametrically by x = at (1) y = 0 (2) is given by x_n = 2at-x (3) y_n = ((x-at)^2)/y, (4) which is a parabola.

Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

Let a line in three dimensions be specified by two points x_1=(x_1,y_1,z_1) and x_2=(x_2,y_2,z_2) lying on it, so a vector along the line is given by v=[x_1+(x_2-x_1)t; ...