On computing a conditional edge-connectivity of a graph
From MaRDI portal
Publication:1095928
DOI10.1016/0020-0190(88)90025-7zbMath0633.05045OpenAlexW1989412486MaRDI QIDQ1095928
Abdol-Hossein Esfahanian, S. Louis Hakimi
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90025-7
Related Items (only showing first 100 items - show all)
On \(g\)-extra connectivity of hypercube-like networks ⋮ A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Edge fault tolerance analysis of a class of interconnection networks ⋮ Restricted connectivity of total digraph ⋮ Fault-tolerant analysis of a class of networks ⋮ Restricted arc-connectivity of digraphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ The super edge connectivity of Kronecker product graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Note on the connectivity of line graphs ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ A new approach to finding the extra connectivity of graphs ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Structure and substructure connectivity of alternating group graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ On restricted edge-connectivity of vertex-transitive multigraphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ Edge fault-tolerance of strongly Menger edge connected graphs ⋮ Tree robustness of a graph ⋮ Robustness of random graphs based on graph spectra ⋮ Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity ⋮ Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube ⋮ Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern ⋮ Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ Structure fault-tolerance of divide-and-swap \(k\)-ary \(n\)-cube ⋮ Reliability evaluation for a class of recursive match networks ⋮ Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs ⋮ Completely independent spanning trees in line graphs ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ Under which conditions is λ″(G)=κ″(L(G)) ? ⋮ Structure connectivity of data center networks ⋮ Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes ⋮ The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph ⋮ \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ On 4-regular 4-connected bipancyclic subgraphs of hypercubes ⋮ Structure fault tolerance of balanced hypercubes ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree ⋮ Generalized measures of fault tolerance in exchanged hypercubes ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ Restricted arc-connectivity in tournaments ⋮ Restricted arc-connectivity of bipartite tournaments ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS ⋮ On the reliability of modified bubble-sort graphs ⋮ The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes ⋮ Vulnerability of super extra edge-connected graphs ⋮ On optimally-\(\lambda^{(3)}\) transitive graphs ⋮ Super restricted edge connectivity of regular graphs ⋮ Unnamed Item ⋮ Some results about the reliability of folded hypercubes ⋮ On restricted connectivities of permutation graphs ⋮ On the edge-connectivity of graphs with two orbits of the same size ⋮ Super edge connectivity properties of connected edge symmetric graphs ⋮ A note on the restricted arc connectivity of oriented graphs of girth four ⋮ A survey of some network reliability analysis and synthesis results ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ On the \(g\)-good-neighbor connectivity of graphs ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ Sufficient conditions for triangle-free graphs to be super-$λ'$ ⋮ Structure and substructure connectivity of divide-and-swap cube ⋮ Unnamed Item ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On the Complexity of Computing the k-restricted Edge-connectivity of a Graph ⋮ Robustness of regular ring lattices based on natural connectivity ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ A proof of an inequality concerning \(k\)-restricted edge connectivity ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs ⋮ Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected ⋮ Edge cuts leaving components of order at least \(m\) ⋮ On the conditional edge connectivity of double-orbit graphs ⋮ The maximal restricted edge connectivity of Kautz undirected graphs ⋮ On conditional connectivity of the Cartesian product of cycles ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs ⋮ Arc fault tolerance of Kautz digraphs ⋮ Restricted fault diameter of hypercube networks ⋮ Structure connectivity and substructure connectivity of hypercubes ⋮ The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ The super connectivity of folded crossed cubes ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ On a kind of restricted edge connectivity of graphs ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ Structure connectivity of hypercubes ⋮ Upper bounds for domination related parameters in graphs on surfaces ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks
Cites Work
This page was built for publication: On computing a conditional edge-connectivity of a graph
