K. Brooks Reid

According to our database, K. Brooks Reid authored at least 32 papers between 1972 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2010

Monochromatic sinks in nearly transitive arc-colored tournaments.

M. Melcher, K. B. Reid

Discret. Math., 2010

2009

Extending partial tournaments.

LeRoy B. Beasley, David E. Brown, K. Brooks Reid

Math. Comput. Model., 2009

2008

Axiomization of the center function on trees.

Henry Martyn Mulder, Michael J. Pelsmajer, K. Brooks Reid

Australas. J Comb., 2008

2007

The Domination Graphs of Complete Paired Comparison Digraphs.

J. Richard Lundgren, K. Brooks Reid, Dustin J. Stewart

Ars Comb., 2007

2006

On arc-traceable tournaments.

Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid

J. Graph Theory, 2006

Quadrangularity and strong quadrangularity in tournaments.

J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart

Australas. J Comb., 2006

2005

On a conjecture of Quintas and arc-traceability in upset tournaments.

Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid

Discuss. Math. Graph Theory, 2005

Balance in trees.

K. B. Reid, E. DePalma

Discret. Math., 2005

2004

Domination and irredundance in tournaments.

K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Australas. J Comb., 2004

2003

Domination Graphs of Tournaments with Isolated Vertices.

David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid

Ars Comb., 2003

2002

Total relative displacement of vertex permutations of <i>K</i>.

K. B. Reid

J. Graph Theory, 2002

2001

Domination Graphs with Nontrivial Components.

David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

Graphs Comb., 2001

1999

Balance vertices in trees.

K. Brooks Reid

Networks, 1999

Landau's Theorem revisited.

Jerrold R. Griggs, K. B. Reid

Australas. J Comb., 1999

1998

The domination and competition graphs of a tournament.

David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

J. Graph Theory, 1998

1997

The k-ball l-path Branch Weight Centroid.

K. Brooks Reid

Discret. Appl. Math., 1997

1995

Realization of digraphs by preferences based on distances in graphs.

Weizhen Gu, K. B. Reid, Walter Schnyder

J. Graph Theory, 1995

Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions.

K. B. Reid, Weizhen Gu

Discret. Math., 1995

1994

Independent edges in bipartite graphs obtained from orientations of graphs.

John G. Gimbel, K. B. Reid

J. Graph Theory, 1994

1992

Peripheral and eccentric vertices in graphs.

K. B. Reid, Weizhen Gu

Graphs Comb., 1992

Plurality preference digraphs realized by trees, II: on realization numbers.

K. B. Reid, Weizhen Gu

Discret. Math., 1992

1991

Centroids to centers in trees.

K. B. Reid

Networks, 1991

The relationship between two algorithms for decisions via sophisticated majority voting with an agenda.

K. B. Reid

Discret. Appl. Math., 1991

1988

Bipartite graphs obtained from adjacency matrices of orientations of graphs.

K. B. Reid

Discret. Math., 1988

1987

Minimum path decompositions of oriented cubic graphs.

K. B. Reid, Keith Wayland

J. Graph Theory, 1987

1986

Largest polygons with vertices in a given finite set.

Craig Cordes, K. B. Reid

Discret. Appl. Math., 1986

1982

Every vertex a king.

K. B. Reid

Discret. Math., 1982

1978

Degree frequencies in digraphs and tournaments.

Brian Alspach, K. B. Reid

J. Graph Theory, 1978

1976

Cycles in the complement of a tree.

K. B. Reid

Discret. Math., 1976

1975

Mutually disjoint families of 0-1 sequences.

Brian Alspach, L. T. Ollmann, K. B. Reid

Discret. Math., 1975

1973

Equivalence of n-tournaments via k-path reversals.

K. B. Reid

Discret. Math., 1973

1972

Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices.

K. B. Reid, Ezra Brown

J. Comb. Theory A, 1972