Walter D. Wallis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2008

Strong edge-magic graphs of maximum sizeJim A. MacDougall, Walter D. Wallis. DM, 308(13):2756-2763, 2008. [doi]

On the anomalous behaviour of a class of locality statisticsC. E. Priebe, Walter D. Wallis. DM, 308(10):2034-2037, 2008. [doi]

2007

Closed-neighbourhood anti-Sperner graphsJohn P. McSorley, Alison Marr, Thomas Dale Porter, Walter D. Wallis. ajc, 38:63-76, 2007. [doi]

2006

Using graph diameter for change detection in dynamic networksMatthew E. Gaston, Miro Kraetzl, Walter D. Wallis. ajc, 35:299-312, 2006. [doi]

2005

Double Arrays, Triple Arrays and Balanced GridsJohn P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas. dcc, 35(1):21-45, 2005. [doi]

The seven classes of 5×6 triple arraysNicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis. DM, 293(1-3):213-218, 2005. [doi]

Paley triple arraysDonald A. Preece, Walter D. Wallis, Joseph L. Yucas. ajc, 33:237-246, 2005. [doi]

2003

Vertex-magic labeling of trees and forestsI. D. Gray, Jim A. MacDougall, John P. McSorley, Walter D. Wallis. DM, 261(1-3):285-298, 2003. [doi]

Vertex-Magic Total Labelings of Complete Bipartite GraphsI. D. Gray, Jim A. MacDougall, R. J. Simpson, Walter D. Wallis. arscom, 69, 2003.

On constant-weight TSP-toursScott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis. dmgt, 23(2):287-307, 2003. [doi]

Strong edge-magic labelling of a cycle with a chordJim A. MacDougall, Walter D. Wallis. ajc, 28:245-256, 2003. [doi]

2002

Totally magic graphsGeoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis. DM, 254(1-3):103-113, 2002. [doi]

Factoring the cartesian product of a cubic graph and a triangleJoseph Douglas Horton, Walter D. Wallis. DM, 259(1-3):137-146, 2002. [doi]

Detection of Abnormal Change in a Time Series of GraphsPeter Shoubridge, Miro Kraetzl, Walter D. Wallis, Horst Bunke. join, 3(1-2):85-101, 2002. [doi]

2001

Graph distances using graph unionWalter D. Wallis, Peter Shoubridge, Miro Kraetzl, D. Ray. prl, 22(6/7):701-704, 2001.

2000

Survey of certain valuations of graphsMartin Baca, Jim A. MacDougall, Mirka Miller, Slamin, Walter D. Wallis. dmgt, 20(2):219-229, 2000. [doi]

Edge-magic total labelingsWalter D. Wallis, Edy Tri Baskoro, Mirka Miller, Slamin. ajc, 22:177-190, 2000. [doi]

1997

Kirkman s school projectsAnton Cerný, Peter Horák, Walter D. Wallis. DM, 167-168:189-196, 1997. [doi]

Counting frequencies of configurations in Steiner Triple SystemsPeter Horák, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas. arscom, 46, 1997.

1995

Symmetric and skew equivalence of Hadamard matrices of order 28A. H. Baartmans, Cantian Lin, Walter D. Wallis. arscom, 41, 1995.

Single change neighbor designsRobert L. Constable, Donald A. Preece, Nicholas C. K. Phillips, Thomas Dale Porter, Walter D. Wallis. ajc, 11:247-256, 1995. [doi]

1994

Maximal sets of triangle- factorsRolf S. Rees, Alexander Rosa, Walter D. Wallis. ajc, 9:67-108, 1994. [doi]

1993

Single Change Covering DesignsWalter D. Wallis, Joseph L. Yucas, Guo-Hui Zhang. dcc, 3(1):9-19, 1993.

Note on the parameters of balanced designsWalter D. Wallis. ajc, 8:75-76, 1993. [doi]

1992

A geometric construction of the Steiner system S(4, 7, 23)Alphonse Baartmans, Walter D. Wallis, Joseph L. Yucas. DM, 102(2):177-186, 1992. [doi]

1991

The spectrum of maximal sets of one-factorsRolf S. Rees, Walter D. Wallis. DM, 97(1-3):357-369, 1991. [doi]

1982

Premature sets of 1-factors or how not to schedule round robin tournamentsAlexander Rosa, Walter D. Wallis. DAM, 4(4):291-297, 1982. [doi]

1978

Graphs with symmetric automorphism groupWalter D. Wallis, Katherine Heinrich. jgt, 2(4):329-336, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL