Mathematics – Combinatorics
Scientific paper
2004-09-24
Australasian Journal of Combinatorics, vol.34, p.247, 2005
Mathematics
Combinatorics
12 pages
Scientific paper
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.
Lundgren Richard J.
Reid K. B.
Severini Simone
Stewart Dustin J.
No associations
LandOfFree
Quadrangularity and Strong Quadrangularity in Tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quadrangularity and Strong Quadrangularity in Tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quadrangularity and Strong Quadrangularity in Tournaments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695235