Notices
Results 1 to 3 of 3

Thread: Tournament graphs/matrices

  1. #1 Tournament graphs/matrices 
    Forum Radioactive Isotope MagiMaster's Avatar
    Join Date
    Jul 2006
    Posts
    3,440
    I have a quick question about tournaments (in the graph theory sense). Imagine a tournament graph on n, an odd number of, points such that the equivalent matrix has a zero-sum across each row and down each column (each node's in-degree equals its out-degree). My question is, are all such tournaments (for a fixed n) equivalent? If not, are they all equivalent for any n > 3? (3 is trivial.)


    Reply With Quote  
     

  2.  
     

  3. #2  
    Forum Professor river_rat's Avatar
    Join Date
    Jun 2006
    Location
    South Africa
    Posts
    1,497
    I have no experience with tournament graphs - maybe this helps?

    http://mathworld.wolfram.com/Tournament.html


    As is often the case with technical subjects we are presented with an unfortunate choice: an explanation that is accurate but incomprehensible, or comprehensible but wrong.
    Reply With Quote  
     

  4. #3  
    Forum Radioactive Isotope MagiMaster's Avatar
    Join Date
    Jul 2006
    Posts
    3,440
    Of course I read that before posting here. It doesn't say anything about the type of tournament I'm asking about. :? Oh well, I guess no one has considered this question before.
    Reply With Quote  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •