Vertex-transitive digraphs of order \(p^5\) are Hamiltonian (Q2341069): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3859800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonicity of vertex-transitive graphs and digraphs of order \(p^4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley graphs of order \(30p\) are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley graphs on nilpotent groups with cyclic commutator subgroup are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in (2, odd, 3)-Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of vertex-transitive graphs of order 4\(p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles and paths in vertex-transitive graphs-current directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in Cayley graphs whose order has few prime factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton paths in vertex-transitive graphs of order \(10p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton paths and cycles in vertex-transitive graphs of order \(6p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs: Symmetric graphs of prime valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in vertex symmetric graphs of order \(2p^ 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in vertex-symmetric graphs of order 5p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in vertex-symmetric graphs of order 4p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric graphs of order a product of two distinct primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley digraphs of prime-power order are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Sufficient Conditions for Vertex-transitive Hamilton Graphs of Prime-power Order / rank
 
Normal rank

Latest revision as of 00:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Vertex-transitive digraphs of order \(p^5\) are Hamiltonian
scientific article

    Statements

    Vertex-transitive digraphs of order \(p^5\) are Hamiltonian (English)
    0 references
    22 April 2015
    0 references
    Summary: We prove that connected vertex-transitive digraphs of order \(p^{5}\) (where \(p\) is a prime) are Hamiltonian, and a connected digraph whose automorphism group contains a finite vertex-transitive subgroup \(G\) of prime power order such that \(G^\prime\) is generated by two elements or elementary abelian is Hamiltonian.
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex-transitive digraphs
    0 references
    Hamilton cycles
    0 references
    coset digraphs
    0 references
    0 references