Search Results for ""

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

The degree (or relative degree, or index) of an extension field K/F, denoted [K:F], is the dimension of K as a vector space over F, i.e., [K:F]=dim_FK. If [K:F] is finite, ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

Consider the recurrence relation x_n=(1+x_0^2+x_1^2+...+x_(n-1)^2)/n, (1) with x_0=1. The first few iterates of x_n are 1, 2, 3, 5, 10, 28, 154, ... (OEIS A003504). The terms ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

It is possible to construct simple functions which produce growing patterns. For example, the Baxter-Hickerson function f(n)=1/3(2·10^(5n)-10^(4n)+2·10^(3n)+10^(2n)+10^n+1) ...

Given a hereditary representation of a number n in base b, let B[b](n) be the nonnegative integer which results if we syntactically replace each b by b+1 (i.e., B[b] is a ...