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

DOI10.1016/j.dam.2005.09.015zbMath1092.05032MaRDI 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 graph; Restricted edge-connectivity; vertex transitive graph

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C75: Structural characterization of families of graphs

05C40: Connectivity

Related Items

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Edge fault tolerance of graphs with respect to super edge connectivity, 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, 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\), Fault-tolerant analysis of a class of networks

Cites Work

• Unnamed Item
• 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
• On restricted edge-connectivity of graphs.