Search Results for ""
1261 - 1270 of 3922 for Line graphsSearch Results
The term cube is used in topology to denote the Cartesian product of any (finite or infinite) number of copies of the closed interval [0,1] equipped with the product topology ...
A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...
Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...
If P be a point in the plane of an equilateral triangle DeltaABC, then the lengths of line segments AP, BP, and CP correspond the sides of a triangle, which is degenerate ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...
The Wolfram Physics Project posits the existence of abstract relations between atoms of space whose pattern defines the structure of physical space. In this approach, two ...
The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...
The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...
Let C be a curve, let O be a fixed point (the pole), and let O^' be a second fixed point. Let P and P^' be points on a line through O meeting C at Q such that P^'Q=QP=QO^'. ...
...
View search results from all Wolfram sites (28121 matches)

