Search Results for ""

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

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...

A reduction system is called finitely terminating (or Noetherian) if there are no infinite rewriting sequences. This property guarantees that any rewriting algorithm will ...

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

Five point geometry is a finite geometry subject to the following three axioms: 1. there exist exactly five points, 2. each two distinct points have exactly one line on both ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

Given a decimal-valued floating-point operation in the IEEE 754-2008 standard, the preferred exponent is the value of the exponent q which preserves the quantum of the ...

The quantum of a finite floating-point representation is the value of a unit in the last position of its significand. In general, the quantum is equal to the radix raised to ...

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...