307 search results - page 21 / 62 » Finite locally-quasiprimitive graphs |
COMBINATORICS
2007
13 years 10 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
FOCM
2011
13 years 4 months ago
2011
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
CCCG
2001
13 years 11 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...