Search Results for ""

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

An interval in which one endpoint is included but not the other. A half-closed interval is denoted [a,b) or (a,b] and is also called a half-open interval. The non-standard ...

A set of methods that are generally superior to ANOVA for small data sets or where sample distributions are non-normal.

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

Given any straight line and a point not on it, there "exists one and only one straight line which passes" through that point and never intersects the first line, no matter ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...