William D. Weakley

According to our database1, William D. Weakley authored at least 16 papers between 1989 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Switching of covering codes.
Discrete Mathematics, 2018

2014
On Compact Symmetric Regularizations of Graphs.
Electr. J. Comb., 2014

2013
Toroidal queens graphs over finite fields.
Australasian J. Combinatorics, 2013

2010
A note on the complexity of C-words.
Theor. Comput. Sci., 2010

2008
The automorphism group of the toroidal queen's graph.
Australasian J. Combinatorics, 2008

2007
An improved lower bound for domination numbers of the Queen's graph.
Australasian J. Combinatorics, 2007

2004
On the domination number of prisms of graphs.
Discussiones Mathematicae Graph Theory, 2004

Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243].
Discrete Mathematics, 2004

2003
The domination number of the toroidal queens graph of size 3k×3k.
Australasian J. Combinatorics, 2003

2002
Upper bounds for domination numbers of the queen's graph.
Discrete Mathematics, 2002

2001
Values of Domination Numbers of the Queen's Graph.
Electr. J. Comb., 2001

1999
Constructing Covering Codes with Given Automorphisms.
Des. Codes Cryptogr., 1999

1996
Hypercube subgraphs with minimal detours.
Journal of Graph Theory, 1996

Random packing by rho-connected rho-regular graphs.
Discrete Mathematics, 1996

1992
On a leverage problem in the hypercube.
Networks, 1992

1989
On the number of Cinfinity-words of each length.
J. Comb. Theory, Ser. A, 1989


  Loading...