Results 221 to 230 of about 6,072 (265)

Fractional shot noise of an SU(<i>N</i>) Kondo system. [PDF]

Beilstein J Nanotechnol
Krychowski D, Lipiński S.
europepmc   +1 more source

A Set of Master Variables for the Two-Star Random Graph. [PDF]

Entropy (Basel)
Akara-Pipattana P, Evnin O.
europepmc   +1 more source

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source

Stable Boundaries of Opinion Dynamics in Heterogeneous Spatial Complex Networks. [PDF]

Entropy (Basel)
Bierwirth M, Lengler J.
europepmc   +1 more source

Even cycles in enhanced hypercube networks under the conditional fault model. [PDF]

Sci Rep
Liu M.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
exaly   +3 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   +2 more sources

Transversals of Vertex Partitions in Graphs

SIAM Journal on Discrete Mathematics, 1990
This paper studies a number of graph-theoretic parameters that are defined by statements of the form: For every partition of the vertex set that satisfies an upper (or lower) bound on the number of elements in each partition class, there is a transveral of the partition that is an independent (or dominating) set.
openaire   +1 more source

Efficient graph automorphism by vertex partitioning

Artificial Intelligence, 1983
We describe a vertex partitioning method and squeeze tree search technique, which can be used to determine the automorphism partition of a graph in polynomial time for all graphs tested, including those which are strongly regular. The vertex partitioning procedure is based on first transforming the graph by the 1-or 2-subdivision transform or the 1-or ...
Fowler, G., Haralick, R., Gray, F. G., Feustel, C., Grinstead, Charles M.   +4 more
openaire   +2 more sources