Quadrangularity and Strong Quadrangularity in Tournaments

Authors J. Richard Lundgren, K. B. Reid, Simone Severini, D. Stewart

Publication date 24 September 2004

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Abstract: The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If M is an orthogonal matrix, then a digraph which supports M must satisfy a condition known as quadrangularity. We look at quadrangularity in tournaments and determine for which orders quadrangular tournaments exist. We also look at a more restrictive necessary condition for a digraph to support an orthogonal matrix, and give a construction for tournaments which meet this condition.

This page was built for publication: Quadrangularity and Strong Quadrangularity in Tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474509)