Let Ã„ be a domain in the extended complex plane C = C âˆª {âˆž} containing infinity, and f an analytic function inÃ„ given by its Taylor series at the point infinity. This series converges inside theâ€¦ (More)

A circuit cover of an edge-weighted graph (G, p) is a multiset of circuits in G such that every edge e is contained in exactly p(e) circuits in the multiset. A nonnegative integer valued weightâ€¦ (More)

This papers surveys some of the work done on trying to capture an intruder in a graph. If the intruder may be located only at vertices, the term searching is employed. If the intruder may be locatedâ€¦ (More)

Let Sc{l,...,n-1) satisfy -S =S mod n. The circulant graph G(n, S) with vertex set IQ, IJ l,â€œâ€˜, u,_r} and edge set E satisfies â€œiiIj E E if and only if i i E S, where all arithmetic is done mod n.â€¦ (More)

The generalized Petersen graph GP(n, k), n > 2 and 1 < k & n 1, has vertex-set (uO,ul ,..., u *-,, vO,u ,,..., v,_,) and edge-set (u,ui+,,uioi,vivi+,:O<i<n-1 with subscripts reduced modulo nt. Inâ€¦ (More)

Matching Designs Brian Alspach and Katherine Heinrich Department of Mathematics and Statistics Simon Fraser University Burnaby, British Columbia V5A IS6 Canada A collection of k-matchings of K 1'1â€¦ (More)

1. Introduction. A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct forâ€¦ (More)