Hamiltonian connectivity of 2-tree-generated networks

DOI10.1016/J.MCM.2007.11.007MaRDI QIDQ1007659zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Hamiltonian edge-connectivity of 2-tree-generated networks
• Linearly many faults in 2-tree-generated networks
• scientific article; zbMATH DE number 7084989
• The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Cites work

• scientific article; zbMATH DE number 3801574 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 2187684 (Why is no real title available?)
• A new class of interconnection networks based on the alternating group
• Arrangement graphs: A class of generalized star graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Hyper Hamiltonian laceability on edge fault star graph
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• On mutually independent Hamiltonian paths
• Properties and characterizations of k ‐trees
• The (n,k)-star graph: A generalized star graph
• The number of labeled k-dimensional trees

Cited in

(7)

• scientific article; zbMATH DE number 7084989 (Why is no real title available?)
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
• The spanning cyclability of Cayley graphs generated by transposition trees
• Hamiltonian edge-connectivity of 2-tree-generated networks
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
• Linearly many faults in 2-tree-generated networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007659)