On m-restricted edge connectivity of undirected generalized De Bruijn graphs
From MaRDI portal
Publication:2874307
DOI10.1080/00207160.2013.778984zbMATH Open1280.05070OpenAlexW2077625924MaRDI QIDQ2874307FDOQ2874307
Authors: Jianping Ou, Jiqing Li 
Publication date: 29 January 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.778984
Recommendations
Cites Work
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Graph theory with applications
- Reliable circuits using less reliable relays
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for λ′‐optimality in graphs with girth g
- The Hamiltonian property of generalized de Bruijn digraphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- On connectivity of consecutive-\(d\) 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
- Title not available (Why is that?)
- Restricted edge-connectivity of de Bruijn digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
