Search Results for ""

Two points z and z^S in C^* are symmetric with respect to a circle or straight line L if all circles and straight lines passing through z and z^S are orthogonal to L. Möbius ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

If two points A and A^' are inverse (sometimes called conjugate) with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The two-point form of a line in the Cartesian plane passing through the points (x_1,y_1) and (x_2,y_2) is given by y-y_1=(y_2-y_1)/(x_2-x_1)(x-x_1), or equivalently, ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.