307 search results - page 30 / 62 » Finite locally-quasiprimitive graphs |
153
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
152
click to vote
APPML
2007
15 years 6 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
171
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
233
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
172
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...