On m-restricted edge connectivity of undirected generalized De Bruijn graphs
From MaRDI portal
Publication:2874307
Recommendations
Cites work
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- Graph theory with applications
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On connectivity of consecutive-d digraphs
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- Reliable circuits using less reliable relays
- Sufficient conditions for λ′‐optimality in graphs with girth g
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Hamiltonian property of generalized de Bruijn digraphs
Cited in
(7)- On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<m≤n3
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- scientific article; zbMATH DE number 2157317 (Why is no real title available?)
- Restricted edge-connectivity of de Bruijn digraphs
- scientific article; zbMATH DE number 5551599 (Why is no real title available?)
- scientific article; zbMATH DE number 2177306 (Why is no real title available?)
- On optimizing \(m\)-restricted edge connectivity of generalized permutation graphs.
This page was built for publication: On \(m\)-restricted edge connectivity of undirected generalized De Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874307)