\ 1, 2 \-good-neighbor conditional diagnosability of Cayley graphs generated by k-trees

DOI10.1016/J.DAM.2025.07.010MaRDI QIDQ6927995zbMATH OpenFDO

Authors Shu-Li Zhao, Baocheng Zhang, Jou-Ming Chang

Publication date 17 September 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.07.010

zbMATH Keywords

Cayley graphs generated by k-treesconditional diagnosabilityg-good-neighbor diagnosabilityPMC/MM* fault model

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks
• A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• A kind of conditional connectivity of transposition networks generated by k-trees
• A kind of conditional fault tolerance of alternating group graphs
• A kind of conditional vertex connectivity of star graphs
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Conditional connectivity of Cayley graphs generated by transposition trees
• Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
• Fault resiliency of Cayley graphs generated by transpositions
• Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• On \(g\)-good-neighbor conditional connectivity and diagnosability of hierarchical star networks
• On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks
• On simple characterizations of k-trees
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Properties and characterizations of k ‐trees
• Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
• Some conditional vertex connectivities of complete-transposition graphs
• The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
• The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
• The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model
• The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
• The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM* model
• The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
• The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes
• The \(g\)-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
• The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model
• The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs
• The \(g\)-good-neighbor diagnosability of locally twisted cubes
• The number of labeled k-dimensional trees
• The number of labeled k-trees

Cited in

(2)

• \(\{ 1, 2, 3 \}\)-extra connectivity of Cayley graphs generated by \(k\)-trees
• The \(g\)-good-neighbor conditional diagnosability of generalized folded hypercubes under the PMC and \(\mathrm{MM}^\ast\) models

This page was built for publication: \(\{ 1, 2 \}\)-good-neighbor conditional diagnosability of Cayley graphs generated by \(k\)-trees

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