Hamiltonian connectivity of 2-tree-generated networks

DOI10.1016/j.mcm.2007.11.007zbMath1156.05323OpenAlexW2065444304MaRDI QIDQ1007659

Marc J. Lipman, Eddie Cheng, David Stiebel, László Lipták

Publication date: 23 March 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.11.007

zbMATH Keywords

Cayley graphinterconnection networkHamiltonian connectivityalternating group graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Connectivity (05C40)

Related Items (3)

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Linearly many faults in 2-tree-generated networks ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• Arrangement graphs: A class of generalized star graphs
• The \((n,k)\)-star graph: A generalized star graph
• On mutually independent Hamiltonian paths
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• A new class of interconnection networks based on the alternating group
• The number of labeled k-dimensional trees
• Properties and characterizations of k ‐trees

This page was built for publication: Hamiltonian connectivity of 2-tree-generated networks