Determining the Hamilton-connectedness of certain vertex-transitive graphs (Q1336694): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding of cycles in arrangement graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arrangement graphs: A class of generalized star graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3936208 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4745845 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey: Hamiltonian cycles in Cayley graphs / rank | |||
Normal rank |
Latest revision as of 10:11, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Determining the Hamilton-connectedness of certain vertex-transitive graphs |
scientific article |
Statements
Determining the Hamilton-connectedness of certain vertex-transitive graphs (English)
0 references
9 November 1995
0 references
Hamilton-connectedness
0 references
permutations
0 references
vertex-transitive digraphs
0 references
inconnection networks
0 references
diameter
0 references
Hamiltonian
0 references
Hamilton path
0 references
arrangement graphs
0 references
Hamilton-connected
0 references