Search Results for ""

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

The expectation value of a function f(x) in a variable x is denoted <f(x)> or E{f(x)}. For a single discrete variable, it is defined by <f(x)>=sum_(x)f(x)P(x), (1) where P(x) ...

Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...

Fano's geometry is a finite geometry attributed to Fano from around the year 1892. This geometry comes with five axioms, namely: 1. There exists at least one line. 2. Every ...

For a general second-order linear recurrence equation f_(n+1)=xf_n+yf_(n-1), (1) define a multiplication rule on ordered pairs by (A,B)(C,D)=(AD+BC+xAC,BD+yAC). (2) The ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...

The first Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_1=sum_(i=1)^nd_i^2. The notations Z_1 (e.g., Lin et al. 2023) ...