Richard A. Brualdi

Affiliations:
  • University of Wisconsin, Department of Mathematics, Madison, USA


According to our database1, Richard A. Brualdi authored at least 94 papers between 1975 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multipermutations and Stirling Multipermutations.
Graphs Comb., February, 2024

Frobenius-König theorem for classes of (0,±1)-matrices.
Discret. Math., 2024

2023
$123$-Forcing matrices.
Australas. J Comb., June, 2023

2022
Permutation graphs and the weak Bruhat order.
Art Discret. Appl. Math., October, 2022

2021
Convex (0, 1)-matrices and their epitopes.
Discret. Appl. Math., 2021

Pattern-avoiding (0, 1)-matrices and bases of permutation matrices.
Discret. Appl. Math., 2021

2020
Alternating Sign Matrices: Extensions, König-Properties, and Primary Sum-Sequences.
Graphs Comb., 2020

Stirling Pairs of Permutations.
Graphs Comb., 2020

The Erdős-Gallai theorem modulo k.
Australas. J Comb., 2020

2019
On the Bruhat order of labeled graphs.
Discret. Appl. Math., 2019

The interval structure of (0, 1)-matrices.
Discret. Appl. Math., 2019

The Gale-Ryser theorem modulo k.
Australas. J Comb., 2019

2018
Circulant matrices and mathematical juggling.
Art Discret. Appl. Math., 2018

Alternating sign matrices and hypermatrices, and a generalization of Latin squares.
Adv. Appl. Math., 2018

2017
Alternating sign matrices and their Bruhat order.
Discret. Math., 2017

Alternating sign matrices, extensions and related cones.
Adv. Appl. Math., 2017

2015
Strict Sign-Central Matrices.
SIAM J. Matrix Anal. Appl., 2015

Completions of Alternating Sign Matrices.
Graphs Comb., 2015

A Gale-Berlekamp permutation-switching problem.
Eur. J. Comb., 2015

Enumeration of involutions by descents and symmetric matrices.
Eur. J. Comb., 2015

Tournaments associated with multigraphs and a theorem of Hakimi.
Discret. Math., 2015

Loopy, Hankel, and combinatorially skew-Hankel tournaments.
Discret. Appl. Math., 2015

2014
Symmetric alternating sign matrices.
Australas. J Comb., 2014

2013
Majorization for partially ordered sets.
Discret. Math., 2013

2012
Cyclic matching sequencibility of graphs.
Australas. J Comb., 2012

2010
Erratum.
Adv. Math. Commun., 2010

Combinatorial batch codes and transversal matroids.
Adv. Math. Commun., 2010

2009
Combinatorial Matrix Analysis.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Landau's and Rado's Theorems and Partial Tournaments.
Electron. J. Comb., 2009

2007
Acyclic digraphs and local hierarchy theory.
Math. Comput. Model., 2007

2006
Sum List Coloring Graphs.
Graphs Comb., 2006

Preface.
Discret. Math., 2006

Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors.
Discret. Math., 2006

Perfect Matching Preservers.
Electron. J. Comb., 2006

2005
Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers.
J. Comb. Theory B, 2005

Matrices of zeros and ones with given line sums and a zero block.
Electron. Notes Discret. Math., 2005

2002
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs.
J. Comb. Theory B, 2002

2001
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments.
J. Graph Theory, 2001

Diameter of the NEPS of bipartite graphs.
Discret. Math., 2001

Multicolored forests in complete bipartite graphs.
Discret. Math., 2001

1999
Discrepancy of Matrices of Zeros and Ones.
Electron. J. Comb., 1999

1997
A retract characterization of posets with the fixed-point property.
Discret. Math., 1997

Generalized Exponents of Primitive Symmetric Digraphs.
Discret. Appl. Math., 1997

1996
On the Spectral Radius of (0, 1)-Matrices with 1's in Prescribed Positions.
SIAM J. Matrix Anal. Appl., 1996

Multicolored Trees in Complete Graphs.
J. Comb. Theory, Ser. B, 1996

1995
The Sparse Basis Problem and Multilinear Algebra.
SIAM J. Matrix Anal. Appl., 1995

Pseudo-Interval Graphs.
J. Graph Theory, 1995

On a Matrix Partition Conjecture.
J. Comb. Theory A, 1995

Codes with a poset metric.
Discret. Math., 1995

On the quasi-transversals of a matroid.
Discret. Math., 1995

1994
Strong Hall Matrices.
SIAM J. Matrix Anal. Appl., April, 1994

Bipartite Graphs and Inverse Sign Patterns of Strong Sign-Nonsingular Matrices.
J. Comb. Theory B, 1994

On the poset of all posets on n elements.
Discret. Appl. Math., 1994

Two Extremal Problems in Graph Theory.
Electron. J. Comb., 1994

1993
Greedy Codes.
J. Comb. Theory A, 1993

Linear Spaces of Toeplitz and Nilpotent Matrices.
J. Comb. Theory A, 1993

Incidence and strong edge colorings of graphs.
Discret. Math., 1993

1992
Sign-Nonsingular Matrix Pairs.
SIAM J. Matrix Anal. Appl., 1992

Orphan structure of the first-order Reed-Muller codes.
Discret. Math., 1992

1991
Weight enumerators of self-dual codes.
IEEE Trans. Inf. Theory, 1991

The polytope of even doubly stochastic matrices.
J. Comb. Theory A, 1991

Multicolored forests in bipartite decompositions of graphs.
J. Comb. Theory B, 1991

Matrices of 0's and 1's with restricted permanental minors.
Discret. Math., 1991

1990
Orphans of the first order Reed-Muller codes.
IEEE Trans. Inf. Theory, 1990

Generalized exponents of primitive directed graphs.
J. Graph Theory, 1990

Matrix factorizations of determinants and permanents.
J. Comb. Theory A, 1990

On the covering radius of a code and its subcodes.
Discret. Math., 1990

On Sign-Nonsingular Matrices and the Conversion of the Permanent into the Determinant.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Short codes with a given coveting radius.
IEEE Trans. Inf. Theory, 1989

Polyadic codes.
Discret. Appl. Math., 1989

1988
In memoriam: Herbert J. Ryser 1923-1985.
J. Comb. Theory A, 1988

Maximum permanents of matrices of zeros and ones.
J. Comb. Theory A, 1988

On strong digraphs with a unique minimally strong subdigraph.
Discret. Math., 1988

1986
On the minimum rank of regular classes of matrices of zeros and ones.
J. Comb. Theory A, 1986

Maximum determinants of complementary acyclic matrices of zeros and ones.
Discret. Math., 1986

Extending subpermutation matrices in regular classes of matrices.
Discret. Math., 1986

1984
Chromatic number of classes of matrices of zeros and ones.
Discret. Math., 1984

Permanent of the Laplacian matrix of trees and bipartite graphs.
Discret. Math., 1984

1983
Upsets in round robin tournaments.
J. Comb. Theory B, 1983

Prime interchange graphs of classes of matrices of zeros and ones.
J. Comb. Theory B, 1983

1981
Hamiltonian line graphs.
J. Graph Theory, 1981

On Haber's Minimum Term Rank Formula.
Eur. J. Comb., 1981

Matrices with isomorphic diagonal hypergraphs.
Discret. Math., 1981

1980
On the Exponent of a Primitive, Nearly Reducible Matrix.
Math. Oper. Res., 1980

Bigraphs versus digraphs via matrices.
J. Graph Theory, 1980

Matrices of 0's and 1's with Total Support.
J. Comb. Theory A, 1980

1979
The diagonal hypergraph of a matrix (bipartite graph).
Discret. Math., 1979

1977
Convex polyhedra of doubly stochastic matrices: II. Graph of Omega<sub>n</sub>.
J. Comb. Theory B, 1977

Convex Polyhedra of Doubly Stochastic Matrices III. Affine and Combinatorial Properties of Omega<sub>n</sub>.
J. Comb. Theory A, 1977

Convex polytopes of permutation invariant doubly stochastic matrices.
J. Comb. Theory B, 1977

Convex Polyhedra of Doubly Stochastic Matrices. I. Applications of the Permanent Function.
J. Comb. Theory A, 1977

1976
The assignment polytope.
Math. Program., 1976

1975
Stochastic Patterns.
J. Comb. Theory A, 1975

Truncations of principal geometries.
Discret. Math., 1975


  Loading...