#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1980

2017

- This year (6)
- Last 5 years (18)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Chris D. Godsil
- Chapman and Hall mathematics series
- 1993

- Chris D. Godsil
- Electr. J. Comb.
- 1995

The number of vertices missed by a maximum matching in a graph G is the multiplicity of zero as a root of the matchings polynomial μ(G,x) of G, and hence many results in matching theory can be expressed in terms of this multiplicity. Thus, if mult(θ,G) denotes the multiplicity of θ as a zero of μ(G,x), then Gallai’s lemma is equivalent to the assertion that… (More)

- Chris D. Godsil, Ivan Gutman
- Journal of Graph Theory
- 1981

- Chris D. Godsil
- Journal of Graph Theory
- 1981

- Chris D. Godsil, Brendan D. McKay
- J. Comb. Theory, Ser. B
- 1990

A k X n Latin rectangle is a k X n matrix with entries from {1,2,.. . , n} such that no entry occurs more than once in any row or column. (Thus each row is a permutation of the integers 1,2,..., n.) Let L(k, n) be the number of k x n Latin rectangles. An outstanding problem is to determine the asymptotic value of L(k, n) as n —• oo, with k bounded by a… (More)

- Chris D. Godsil
- Combinatorica
- 1988

- Chris D. Godsil
- Discrete Mathematics
- 2012

- Chris D. Godsil, M. W. Newman
- Combinatorica
- 2006

Let X be k-regular graph on v vertices and let τ denote the least eigenvalue of its adjacency matrix A(X). If α(X) denotes the maximum size of an independent set in X, we have the following well known bound: α(X) ≤ v 1− k τ . It is less well known that if equality holds here and S is a maximum independent set in X with characteristic vector x, then the… (More)

- László Babai, Chris D. Godsil
- Eur. J. Comb.
- 1982

In view of applications like the distribution of cryptographic keys 1,2 or communication between registers in quantum devices 3,4 , the study of the natural evolution of permanently coupled spin networks has become increasingly important. A special case of interest consists of homogeneous networks of particles coupled by constant and fixed nearestneighbor… (More)