Super \(\lambda_3\)-optimality of regular graphs

DOI10.1016/j.aml.2011.07.018zbMath1242.05145OpenAlexW2062163585MaRDI QIDQ659824

Xiaofeng Guo, Litao Guo, Rui-fang Liu

Publication date: 24 January 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.07.018

zbMATH Keywords

interconnection networksfault-tolerance3-restricted edge connectivitysuper-\(\lambda _{3}\)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
• Longest fault-free paths in hypercubes with vertex faults
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• On reliability of the folded hypercubes
• Substar reliability analysis in star networks
• Conditional matching preclusion sets
• On computing a conditional edge-connectivity of a graph
• On the connectivity of clusters
• On a kind of restricted edge connectivity of graphs
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Optimally super-edge-connected transitive graphs
• On the extraconnectivity of graphs
• Über den Zusammenhang symmetrischer Graphen
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for a graph to be super restricted edge-connected
• A Graph-Theoretic Approach to a Communications Problem
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs

This page was built for publication: Super \(\lambda_3\)-optimality of regular graphs