UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Quadrangularity and Strong Quadrangularity in Tournaments

Lundgren, JR; Reid, KB; Severini, S; Stewart, DJ; (2004) Quadrangularity and Strong Quadrangularity in Tournaments. Australasian Journal of Combinatorics , 34 247 - ?.

Full text not available from this repository.

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.

Type:Article
Title:Quadrangularity and Strong Quadrangularity in Tournaments
Additional information:12 pages
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record