Super edge connectivity properties of connected edge symmetric graphs

DOI10.1002/(SICI)1097-0037(199903)33:2%3C157::AID-NET6%3E3.0.CO;2-DzbMATH Open0918.90076OpenAlexW2166010209MaRDI QIDQ4242785FDOQ4242785

Authors: 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%3C157::aid-net6%3E3.0.co;2-d

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (32)

• \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
• Title not available (Why is that?)
• On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
• Super restricted edge connectivity of regular edge-transitive graphs
• On the super (edge)-connectivity of generalized Johnson graphs
• Edge fault tolerance of graphs with respect to super edge connectivity
• On super restricted edge-connectivity of edge-transitive 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
• The restricted edge-connectivity and restricted connectivity of augmented \(k\)-ary \(n\)-cubes

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)