• Corpus ID: 119251154

The $g$-good neighbour diagnosability of hierarchical cubic networks

@article{Zhao2018TheN,
  title={The \$g\$-good neighbour diagnosability of hierarchical cubic networks},
  author={Shu-Li Zhao and Rongxia Hao},
  journal={arXiv: Combinatorics},
  year={2018}
}
Let $G=(V, E)$ be a connected graph, a subset $S\subseteq V(G)$ is called an $R^{g}$-vertex-cut of $G$ if $G-F$ is disconnected and any vertex in $G-F$ has at least $g$ neighbours in $G-F$. The $R^{g}$-vertex-connectivity is the size of the minimum $R^{g}$-vertex-cut and denoted by $\kappa^{g}(G)$. Many large-scale multiprocessor or multi-computer systems take interconnection networks as underlying topologies. Fault diagnosis is especially important to identify fault tolerability of such… 
1 Citations

Figures from this paper

References

SHOWING 1-10 OF 29 REFERENCES
A kind of conditional fault tolerance of alternating group graphs
The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM⁎ model
On conditional fault tolerance and diagnosability of hierarchical cubic networks
Conditional connectivity of Cayley graphs generated by transposition trees
The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
TLDR
This paper gives that the 1-good-neighbour diagnosability of under the PMC model and MM model is except the bubble-sort graph under MM model, where, and the1- good-neIGHbour diagnOSability ofUnder theMM model is 4.
A kind of conditional vertex connectivity of star graphs
...
...