William D. Weakley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2022

Queen Domination of Even Square BoardsWilliam D. Weakley. combinatorics, 29(2), 2022. [doi]

2019

Domination of the Rectangular Queen's GraphSándor Bozóki, Péter Gál, István Marosi, William D. Weakley. combinatorics, 26(4):4, 2019. [doi]

2018

Switching of covering codesPatric R. J. Östergård, William D. Weakley. DM, 341(6):1778-1788, 2018. [doi]

2014

On Compact Symmetric Regularizations of GraphsRobert C. Vandell, Matt Walsh, William D. Weakley. combinatorics, 21(3):3, 2014. [doi]

2013

Toroidal queens graphs over finite fieldsWilliam D. Weakley. ajc, 57:21-38, 2013. [doi]

2010

A note on the complexity of C::: INFINITY :::-wordsYun Bao Huang, William D. Weakley. TCS, 411(40-42):3731-3735, 2010. [doi]

2008

The automorphism group of the toroidal queen's graphWilliam D. Weakley. ajc, 42:141-158, 2008. [doi]

2007

An improved lower bound for domination numbers of the Queen's graphDmitry Finozhenok, William D. Weakley. ajc, 37:295-300, 2007. [doi]

2004

On the domination number of prisms of graphsAlewyn P. Burger, Christina M. Mynhardt, William D. Weakley. dmgt, 24(2):303-318, 2004. [doi]

Erratum to Upper bounds for domination numbers of the queen s graph : [Discrete Mathematics 242 (2002) 229-243]William D. Weakley. DM, 277(1-3):321, 2004. [doi]

2003

The domination number of the toroidal queens graph of size 3k×3kAlewyn P. Burger, Christina M. Mynhardt, William D. Weakley. ajc, 28:137-148, 2003. [doi]

2002

Upper bounds for domination numbers of the queen s graphWilliam D. Weakley. DM, 242(1-3):229-243, 2002. [doi]

2001

Values of Domination Numbers of the Queen s GraphPatric R. J. Östergård, William D. Weakley. combinatorics, 8(1), 2001. [doi]

1999

Constructing Covering Codes with Given AutomorphismsPatric R. J. Östergård, William D. Weakley. dcc, 16(1):65-73, 1999.

1996

Random packing by rho-connected rho-regular graphsLowell W. Beineke, Peter Hamburger, William D. Weakley. DM, 160(1-3):41-47, 1996. [doi]

Hypercube subgraphs with minimal detoursPaul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley. jgt, 23(2):119-128, 1996. [doi]

1989

On the number of ::::C:::::::infinity:::-words of each lengthWilliam D. Weakley. JCT, 51(1):55-62, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL