Super edge connectivity properties of connected edge symmetric graphs

DOI10.1002/(SICI)1097-0037(199903)33:2%3C157::AID-NET6%3E3.0.CO;2-DMaRDI QIDQ4242785zbMATH OpenOpenAlexFDO

Publication date 4 August 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199903)33:2%3C157::aid-net6%3E3.0.co;2-d

super edge connectivity \(d\)-regular edge-symmetric graph

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

scientific article; zbMATH DE number 3891426
Super restricted edge connectivity of regular graphs
Super-connectivity and super-edge-connectivity for some interconnection networks
Edge fault tolerance of graphs with respect to super edge connectivity
Super restricted edge connectivity of regular edge-transitive graphs

Cites work

Circulants and their connectivities
Complexity of network reliability computations
Connectivity of transitive graphs
On computing a conditional edge-connectivity of a graph
Super Line-Connectivity Properties of Circulant Graphs
Synthesis of reliable networks - a survey

Cited in

(32)

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
The restricted edge-connectivity and restricted connectivity of augmented \(k\)-ary \(n\)-cubes
\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
scientific article; zbMATH DE number 3891426 (Why is no real title available?)
Super restricted edge connectivity of regular edge-transitive graphs
Edge fault tolerance of graphs with respect to super edge connectivity
On super restricted edge-connectivity of edge-transitive graphs
On the super (edge)-connectivity of generalized Johnson graphs
On the reliability of modified bubble-sort graphs
Codes from incidence matrices of graphs
Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
Packing spanning trees in highly essentially connected graphs
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
Super restricted edge connectivity of regular graphs with two orbits
Sufficient conditions for restricted-edge-connectivity to be optimal
Super-connected arc-transitive digraphs
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
Connectivity of vertex and edge transitive graphs
Some results about the reliability of folded hypercubes
On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
On a kind of restricted edge connectivity of graphs
Super link-connectivity of iterated line digraphs.
On optimally-\(\lambda^{(3)}\) transitive graphs
On the edge-connectivity of graphs with two orbits of the same size
Super-connected but not super edge-connected graphs
A proof of an inequality concerning \(k\)-restricted edge connectivity
Inverse degree and super edge-connectivity
On optimizing edge connectivity of product graphs
A new approach to finding the extra connectivity of graphs
On restricted edge-connectivity of replacement product graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242785)