Search Results for ""

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

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). ...

Let sigma(m) be the divisor function of m. Then two numbers m and n are a quasiamicable pair if sigma(m)=sigma(n)=m+n+1. The first few are (48, 75), (140, 195), (1050, 1925), ...

A quasiperfect number, called a "slightly excessive number" by Singh (1997), is a "least" abundant number, i.e., one such that sigma(n)=2n+1. Quasiperfect numbers are ...

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 base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

Qubic is a generalization of tic-tac-toe in which players alternately place pieces to get four in a row (rows, columns, pillars, face diagonals, or space diagonals) on a ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

A technical conjecture which connects algebraic K-theory to étale cohomology. The conjecture was made more precise by Dwyer and Friedlander (1982). Thomason (1985) ...

A quintic surface is an algebraic surface of degree 5. Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not ...