Results 241 to 250 of about 125,344 (284)

Distance domination in vertex partitioned graphs

open access: yes, 2009
Frendrup, Allan   +2 more
openaire   +1 more source

Partition Function of the Eight-Vertex Lattice Model

Annals of Physics, 1972
The partition function of the zero-field “Eight-Vertex” model on a square M by N lattice is calculated exactly in the limit of M, N large. This model includes the dimer, ice and zero-field Ising, F and KDP models as special cases. In general the free energy has a branch point singularity at a phase transition, with an irrational exponent.
openaire   +4 more sources

Canonical Vertex Partitions

Combinatorics, Probability and Computing, 2003
Let σ be a finite relational signature, let be a set of finite complete relational structures of signature σ, and let be the countable homogeneous relational structure of signature σ which does not embed any of the structures in .When σ consists of at most binary relations and is finite, the vertex partition behaviour of is completely analysed, in ...
openaire   +1 more source

Distant Vertex Partitions of Graphs

Combinatorics, Probability and Computing, 1998
We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for
openaire   +1 more source

Home - About - Disclaimer - Privacy