Search Results for ""

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

The projective special linear group PSL_n(q) is the group obtained from the special linear group SL_n(q) on factoring by the scalar matrices contained in that group. It is ...

The projective special orthogonal group PSO_n(q) is the group obtained from the special orthogonal group SO_n(q) on factoring by the scalar matrices contained in that group. ...

The projective special unitary group PSU_n(q) is the group obtained from the special unitary group SU_n(q) on factoring by the scalar matrices contained in that group. ...

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

The quintuple product identity, also called the Watson quintuple product identity, states (1) It can also be written (2) or (3) The quintuple product identity can be written ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...