CPC
2006
13 years 4 months ago
2006
We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lov
CPC
2006
13 years 4 months ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
CPC
2006
13 years 4 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
CPC
2006
13 years 4 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
CPC
2006
13 years 4 months ago
2006
CPC
2006
13 years 4 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
CPC
2006
13 years 4 months ago
2006
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob
CPC
2006
13 years 4 months ago
2006
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
CPC
2006
13 years 4 months ago
2006
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid...
CPC
2006
13 years 4 months ago
2006
