Search Results for ""

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...