A kind of conditional connectivity of transposition networks generated by \(k\)-trees

DOI10.1016/j.dam.2017.11.025zbMath1380.05103arXiv1708.02692OpenAlexW2963109566MaRDI QIDQ1701105

Weihua Yang

Publication date: 22 February 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.02692

zbMATH Keywords

fault tolerancestar graphstransposition networksbubble sort graphstransposition generating trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
• Generalized measures of fault tolerance in hypercube networks
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• Some conditional vertex connectivities of complete-transposition graphs
• Extraconnectivity of hypercubes
• A kind of conditional vertex connectivity of star graphs
• A kind of conditional fault tolerance of alternating group graphs
• Conditional connectivity of Cayley graphs generated by transposition trees
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Linearly many faults in Cayley graphs generated by transposition trees
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• Conditional connectivity
• Transposition networks as a class of fault-tolerant robust networks
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• The number of labeled k-dimensional trees
• Properties and characterizations of k ‐trees