On optimally-\(\lambda^{(3)}\) transitive graphs

DOI10.1016/j.dam.2005.09.015zbMath1092.05032OpenAlexW2089783524MaRDI QIDQ2492202

Zhao Zhang, Ji Xiang Meng

Publication date: 9 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.015

zbMATH Keywords

Cayley graphRestricted edge-connectivityvertex transitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (14)

Fault-tolerant analysis of a class of networks ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Under which conditions is λ″(G)=κ″(L(G))  ? ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ On the reliability of modified bubble-sort graphs ⋮ Some results about the reliability of folded hypercubes ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Semi-hyper-connected vertex transitive graphs ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ On the conditional edge connectivity of double-orbit graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing a conditional edge-connectivity of a graph
• 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
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Complexity of network reliability computations
• Super edge connectivity properties of connected edge symmetric graphs
• On restricted edge-connectivity of graphs.

This page was built for publication: On optimally-\(\lambda^{(3)}\) transitive graphs