Search Results - "Wallis, W.D."

Triple arrays and related designs by Wallis, W.D.

“…We consider a problem posed by Donald Preece more than 30 years ago. Let S be a set of 35 distinct elements. Construct a 7×15 rectangular array A, each of…”
Get full text

Graph distances using graph union by Wallis, W.D., Shoubridge, P., Kraetz, M., Ray, D.

“…An existing graph distance metric based on maximum common subgraph has been extended by a proposal to define the problem size with the union of the two graphs…”
Get full text

Strong edge-magic graphs of maximum size by MacDougall, J.A., Wallis, W.D.

“…An edge-magic total labeling on G is a one-to-one map λ from V ( G ) ∪ E ( G ) onto the integers 1 , 2 , … , | V ( G ) ∪ E ( G ) | with the property that,…”
Get full text

On the anomalous behaviour of a class of locality statistics by Priebe, C.E., Wallis, W.D.

“…A scan statistic methodology for detecting anomalies has been developed for application to graphs, where “anomalies” are equated with vertices that exhibit…”
Get full text

The seven classes of 5 × 6 triple arrays by Phillips, N.C.K., Preece, D.A., Wallis, W.D.

“…Triple arrays are considered in which 10 symbols each appear 3 times in a 5 × 6 arrangement of symbols. These triple arrays fall into seven isomorphism…”
Get full text

Vertex-magic labeling of trees and forests by Gray, I.D., MacDougall, J., McSorley, J.P., Wallis, W.D.

“…A vertex-magic total labeling of a graph G( V, E) is a one-to-one map λ from E∪ V onto the integers {1,2,…,| E|+| V|} such that λ(x)+∑λ(xy), where the sum is…”
Get full text

Totally magic graphs by Exoo, Geoffrey, Ling, Alan C.H., McSorley, John P., Phillips, N.C.K., Wallis, W.D.

“…A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1,2,…, v+ e. Such a…”
Get full text

Factoring the cartesian product of a cubic graph and a triangle by Horton, J.D., Wallis, W.D.

“…Kotzig asked: does the cartesian product of a bridgeless cubic graph with a triangle always have a one-factorization? We answer this in the affirmative. Indeed…”
Get full text

Regular graph designs by Wallis, W.D.

“…In this survey paper, measures of optimality of experimental designs are discussed from a combinatorial viewpoint. The main vehicle for this discussion is the…”
Get full text

Kirkman's school projects by Černý, A., Horák, P., Wallis, W.D.

“…We discuss the generalization of Kirkman's Schoolgirl Problem to the case where the number of schoolgirls is not a multiple of 3. It is required that all…”
Get full text

Maximal sets of mutually orthogonal Latin squares by Drake, David A., van Rees, G.H.J., Wallis, W.D.

“…Maximal sets of s mutually orthogonal Latin squares of order v are constructed for infinitely many new pairs ( s, v)…”
Get full text

A family of resolvable regular graph designs by Kreher, Donald L., Royle, Gordon F., Wallis, W.D.

“…A regular graph design RGD(v,k;r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either λ…”
Get full text

WILE, IRA S. Handedness, Right and Left. Pp. x, 439. Boston: Lothrop, Lee and Shepard Co., 1934. $2.75 by Wallis, W.D.

Get full text

Measuring change in large enterprise data networks by Bunke, H., Kraetzl, M., Shoubridge, P.J., Wallis, W.D.

“…In the management of large enterprise data communication networks, it is difficult to discern the causes of abnormal variations in traffic distributions on the…”
Get full text