Super edge connectivity properties of connected edge symmetric graphs

From MaRDI portal
Publication:4242785

DOI<157::AID-NET6>3.0.CO;2-D 10.1002/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-DzbMath0918.90076OpenAlexW2166010209MaRDI QIDQ4242785

Qiaoliang Li, Qiao Li

Publication date: 4 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199903)33:2<157::aid-net6>3.0.co;2-d




Related Items (29)

Packing spanning trees in highly essentially connected graphsOn a kind of restricted edge connectivity of graphsSufficient conditions for optimally and super m-restricted edge-connected graphs with given girthA new approach to finding the extra connectivity of graphsOn super 2-restricted and 3-restricted edge-connected vertex transitive graphsEdge fault tolerance of graphs with respect to super edge connectivitySuper link-connectivity of iterated line digraphs.On optimizing edge connectivity of product graphsSuper-connected but not super edge-connected graphsSuper restricted edge connectivity of regular edge-transitive graphs\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphsSuper restricted edge connectivity of regular graphs with two orbitsCodes from incidence matrices of graphsOn restricted edge-connectivity of replacement product graphsEdge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphsMaximally edge-connected and vertex-connected graphs and digraphs: A surveySufficient conditions for restricted-edge-connectivity to be optimalOn the reliability of modified bubble-sort graphsSufficient conditions for \(\lambda _k\)-optimality in triangle-free graphsThe restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubesOn optimally-\(\lambda^{(3)}\) transitive graphsOn super restricted edge-connectivity of edge-transitive graphsSome results about the reliability of folded hypercubesOn the edge-connectivity of graphs with two orbits of the same sizeUnnamed ItemConnectivity of vertex and edge transitive graphsSuper-connected arc-transitive digraphsSufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connectedA proof of an inequality concerning \(k\)-restricted edge connectivity



Cites Work


This page was built for publication: Super edge connectivity properties of connected edge symmetric graphs