Onm-restricted edge connectivity of undirected generalized De Bruijn graphs

DOI10.1080/00207160.2013.778984zbMath1280.05070OpenAlexW2077625924MaRDI QIDQ2874307

Jiqing Li, Jianping Ou

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

zbMATH Keywords

network reliabilityrestricted edge connectivityDe Bruijn graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

On efficient absorbant conjecture in generalized De Bruijn digraphs

Cites Work

• Unnamed Item
• On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• The Hamiltonian property of generalized de Bruijn digraphs
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• On connectivity of consecutive-\(d\) digraphs
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Edge cuts leaving components of order at least \(m\)
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Reliable circuits using less reliable relays

This page was built for publication: Onm-restricted edge connectivity of undirected generalized De Bruijn graphs