Search Results for ""

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...

An ascending chain of subspaces of a vector space. If V is an n-dimensional vector space, a flag of V is a filtration V_0 subset V_1 subset ... subset V_r, (1) where all ...

The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...

Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

An Eisenstein series with half-period ratio tau and index r is defined by G_r(tau)=sum^'_(m=-infty)^inftysum^'_(n=-infty)^infty1/((m+ntau)^r), (1) where the sum sum^(') ...