Search Results for ""

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

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

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...