Search Results for ""

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

As of 2014, the IEEE 754-2008 is the most commonly implemented standard for floating-point arithmetic. This framework is a massive overhaul of its predecessor IEEE 754-1985 ...

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

An inverse permutation is a permutation in which each number and the number of the place which it occupies are exchanged. For example, p_1 = {3,8,5,10,9,4,6,1,7,2} (1) p_2 = ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...