The preclusion numbers and edge preclusion numbers in a class of Cayley graphs

DOI10.1016/J.DAM.2020.04.010MaRDI QIDQ777422zbMATH OpenOpenAlexFDO

Authors Guozhen Zhang

Publication date 7 July 2020

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

Full work available at URL https://doi.org/10.1016/j.dam.2020.04.010

zbMATH Keywords

Cayley graphsfault toleranceinterconnection networksedge preclusion numberpreclusion number

Mathematics Subject Classification ID

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

Recommendations

• Conditional fault tolerance in a class of Cayley graphs
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
• Conditional matching preclusion for Cayley graphs generated by transposition trees
• Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
• Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

Cites work

• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• scientific article; zbMATH DE number 1242264 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• A note on edge fault tolerance with respect to hypercubes
• A study of fault tolerance in star graph
• Conditional fault tolerance in a class of Cayley graphs
• Conditional matching preclusion number for the Cayley graph on the symmetric group
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Fault tolerance in \(k\)-ary \(n\)-cube networks
• Fault tolerance in bubble-sort graph networks
• Fault tolerance in the arrangement graphs
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Fault-free longest paths in star networks with conditional link faults
• Graph theory
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• How robust is the n-cube?
• Improving bounds on link failure tolerance of the star graph
• Link failure tolerance in the arrangement graphs
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Robustness of star graph network under link failure
• Subnetwork preclusion for bubble-sort networks

Cited in

(3)

• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• Conditional fault tolerance in a class of Cayley graphs
• Subnetwork Preclusion of (n,k)-Star Networks

This page was built for publication: The preclusion numbers and edge preclusion numbers in a class of Cayley graphs

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