Optimally super-edge-connected transitive graphs

From MaRDI portal
Publication:1861264

DOI10.1016/S0012-365X(02)00675-1zbMath1008.05084MaRDI QIDQ1861264

Ji Xiang Meng

Publication date: 16 March 2003

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




Related Items (44)

A sufficient condition for graphs to be super \(k\)-restricted edge connectedMatching preclusion for vertex-transitive networksSufficient conditions for \(k\)-restricted edge connected graphsFault-tolerant analysis of a class of networksSufficient conditions for optimally and super m-restricted edge-connected graphs with given girthDegree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimalBounds for the Super Extra Edge Connectivity of GraphsOn restricted edge-connectivity of vertex-transitive multigraphsOn super restricted edge connectivity of half vertex transitive graphsOptimally restricted edge connected elementary Harary graphsVulnerability of super edge-connected networksOn super 2-restricted and 3-restricted edge-connected vertex transitive graphsEdge fault tolerance of graphs with respect to super edge connectivity\( R_3\)-connectivity of folded hypercubesSuper restricted edge connectivity of regular graphs with two orbits\(\{2,3\}\)-restricted connectivity of locally twisted cubesOn restricted edge-connectivity of replacement product graphsEdge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphsSufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connectedSuper \(\lambda_3\)-optimality of regular graphsMaximally edge-connected and vertex-connected graphs and digraphs: A surveyEdge-connectivity of regular graphs with two orbitsSufficient conditions for restricted-edge-connectivity to be optimalExtra edge connectivity and isoperimetric edge connectivityConnectivity of half vertex transitive digraphsMinimally restricted edge connected graphs\(h\)-restricted connectivity of locally twisted cubesSufficient conditions for \(\lambda _k\)-optimality in triangle-free graphsVulnerability of super extra edge-connected graphsOn optimally-\(\lambda^{(3)}\) transitive graphsOn super restricted edge-connectivity of edge-transitive graphsOn the edge-connectivity of graphs with two orbits of the same size\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)Super edge-connectivity of mixed Cayley graphSufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2Minimally 3-restricted edge connected graphsA neighborhood condition for graphs to be maximally \(k\)-restricted edge connectedSufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connectedEdges of degree \(k\) in minimally restricted \(k\)-edge connected graphsThe \(k\)-restricted edge connectivity of undirected Kautz graphsA proof of an inequality concerning \(k\)-restricted edge connectivityDegree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connectedOn the conditional edge connectivity of double-orbit graphsMatching preclusion for cube-connected cycles






This page was built for publication: Optimally super-edge-connected transitive graphs