Infinite families of non-Cayley vertex-transitive tournaments (Q704285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Construction for Vertex-Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Fixed-Point-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156452 / rank
 
Normal rank

Latest revision as of 17:21, 7 June 2024

scientific article
Language Label Description Also known as
English
Infinite families of non-Cayley vertex-transitive tournaments
scientific article

    Statements

    Infinite families of non-Cayley vertex-transitive tournaments (English)
    0 references
    0 references
    13 January 2005
    0 references
    The author constructs non-Cayley vertex-transitive tournaments of order \(p^k\), for all primes \(p\geq 3\) and \(k\geq 4\). The construction is based on metacirculant digraphs. This is then extended to produce non-Cayley vertex-transitive tournaments of other orders.
    0 references
    0 references
    0 references
    non-Cayley vertex-transiitve tournaments
    0 references
    metacirculant digraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references