Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs

DOI10.1016/j.tcs.2020.09.042zbMath1468.05111OpenAlexW3089651501MaRDI QIDQ2210518

Peiheng Li, Ji Xiang Meng

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.042

zbMATH Keywords

Cayley graphsunicyclic graphstransposition graphsmodified bubble-sort graphstriangle free

Mathematics Subject Classification ID

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

Related Items (2)

Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern ⋮ Reliability assessment for modified bubble-sort networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
• A strong connectivity property of the generalized exchanged hypercube
• Linearly many faults in dual-cube-like networks
• Restricted connectivity for three families of interconnection networks
• Linearly many faults in Cayley graphs generated by transposition trees
• LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
• Linearly many faults in 2-tree-generated networks
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• On the maximal connected component of a hypercube with faulty vertices III
• Increasing the connectivity of the star graphs
• Linearly many faults in arrangement graphs

This page was built for publication: Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs