Search Results for ""

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...

A one-dimensional geometric object such as a pencil or line segment range.

Three sets of three lines such that each line is incident with two from both other sets.

A function f(x) has a vertical tangent line at x_0 if f is continuous at x_0 and lim_(x->x_0)f^'(x)=+/-infty.

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

A kayak paddle graph KP(k,m,l) is the graph obtained by joining cycle graphs C_k and C_m by a path of length l (Gallian 2018). KP(3,3,1) is isomorphic to the 3-barbell graph. ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

The intercept form of a line in the Cartesian plane with x-intercept a and y-intercept b is given by x/a+y/b=1.

A point which lies on at least one ordinary line is called an ordinary point, or sometimes a regular point.