Search Results for ""

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The perspectrix X of a pair of paralogic triangles DeltaA_1A_2A_3 and DeltaB_1B_2B_3 bisects the line joining the two orthocenters H_A and H_B (Johnson 1929, p. 259).

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

The anticomplement of a point P in a reference triangle DeltaABC is a point P^' satisfying the vector equation P^'G^->=2GP^->, (1) where G is the triangle centroid of ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...