Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter

DOI10.1016/j.ipl.2005.05.006zbMath1185.68081MaRDI QIDQ1041803

Camino Balbuena, A. Diánez, Martín Cera, Pedro García-Vázquez, Xavier Marcote

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.006

zbMATH Keywords

fault tolerance; restricted edge-connectivity; conditional diameter

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

\(\{2,3\}\)-extraconnectivities of hypercube-like networks, \(\lambda^{\prime}\)-optimality of bipartite digraphs, On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\), On optimizing edge connectivity of product graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Diameter-girth sufficient conditions for optimal extraconnectivity in graphs, \(\lambda ^{\prime}\)-optimal digraphs, The restricted arc connectivity of Cartesian product digraphs, Diameter-sufficient conditions for a graph to be super-restricted connected, \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs, Sufficient conditions for a graph to be λ _k -optimal with given girth and diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• On computing a conditional edge-connectivity of a graph
• Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
• Maximally connected digraphs