Vertex fault tolerance of G(G₀,G₁;M) networks with respect to maximally connectivity

DOI10.13568/J.CNKI.651094.2018.03.006MaRDI QIDQ4624798zbMATH OpenFDO

Authors Gaoxing Sun, Jixiang Meng

Publication date 22 February 2019

Full work available at URL https://doi.org/10.13568/J.CNKI.651094.2018.03.006

zbMATH Keywords

interconnection networkmaximally connectivityvertex fault tolerance

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
• Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
• Realizability of fault-tolerant graphs
• Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
• Maximally and super connected multisplit graphs and digraphs

Cited in

(5)

• Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs
• Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
• Realizability of fault-tolerant graphs
• On Group Graphs and Their Fault Tolerance
• Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs

This page was built for publication: Vertex fault tolerance of \(G(G_0,G_1;M)\) networks with respect to maximally connectivity

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