Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (Q1007617): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Christmas tree: a versatile 1-fault-tolerant design for token rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ring embedding in faulty honeycomb rectangular torus. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding a ring in a hypercube with both faulty links and faulty nodes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal 1-Hamiltonian graphs / rank | |||
Normal rank |
Latest revision as of 04:47, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs |
scientific article |
Statements
Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (English)
0 references
23 March 2009
0 references
Hamiltonian
0 references
diameter
0 references
complete binary tree
0 references
interconnection networks
0 references