Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
From MaRDI portal
Publication:4667802
Recommendations
Cites work
Cited in
(47)- Vulnerability of super edge-connected networks
- A characterization of graphs by codes from their incidence matrices
- \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- The restricted edge-connectivity and \(\lambda^\prime\)-optimality of hypergraphs
- Edge fault-tolerance of strongly Menger edge connected graphs
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- Edge-connectivity in hypergraphs
- Sufficient conditions for graphs to be super restricted edge connected
- Codes from incidence matrices of graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Fault-tolerant analysis of a class of networks
- Optimization problems of the third edge-connectivity of graphs
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Sufficient conditions for maximally restricted edge connected graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Super connectivity of line graphs
- The k-restricted edge connectivity of undirected Kautz graphs
- On the connectivity and restricted edge-connectivity of 3-arc graphs
- The k-restricted edge connectivity of balanced bipartite graphs
- On edge-connectivity and super edge-connectivity of interconnection networks modeled by product graphs
- Sufficient conditions for maximally edge-connected hypergraphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs
- Restricted arc-connectivity of digraphs
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- On reliability of the folded hypercubes
- Sufficient conditions for '-optimality in graphs of diameter 2
- Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
- Minimally restricted edge connected graphs
- scientific article; zbMATH DE number 2186061 (Why is no real title available?)
- scientific article; zbMATH DE number 6010646 (Why is no real title available?)
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- Sufficient conditions for triangle-free graphs to be super-\(\lambda'\)
- Super \(\lambda_3\)-optimality of regular graphs
- Super-\(\lambda \) connectivity of bipartite graphs.
- On super edge-connectivity of product graphs
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- On restricted edge-connectivity of replacement product graphs
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Neighborhood conditions for graphs to be super restricted edge connected
- Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
This page was built for publication: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667802)
