Hamiltonian connectivity of 2-tree-generated networks

DOI10.1016/J.MCM.2007.11.007zbMATH Open1156.05323OpenAlexW2065444304MaRDI QIDQ1007659FDOQ1007659

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

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

zbMATH Keywords

Cayley graphinterconnection networkHamiltonian connectivityalternating group graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• 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
• Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• Linearly many faults in 2-tree-generated networks
• Title not available (Why is that?)

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)