Search Results for ""

Line segment ranges and pencils which have equal cross ratios are said to be equicross.

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

Two non-coincident plane angles alpha and beta in angle standard position are said to be coterminal if the terminal side of alpha is identically the same as the terminal side ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

An axiomatic system is said to be categorical if there is only one essentially distinct representation for it. In particular, the names and types of objects within the system ...