Minimum cuts of distance-regular digraphs

zbMath1372.05085MaRDI QIDQ2409834

Gholamreza Omidi, Fateme Shafiei, Saleh Ashkboos, Khosro Tajbakhsh

Publication date: 16 October 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p2

zbMATH Keywords

connectivityminimum cutsdistance-regular digraphsstrongly regular digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Minimum arc-cuts of normally regular digraphs and Deza digraphs

Cites Work

• Unnamed Item
• Spectra of graphs
• The girth of a directed distance-regular graph
• The vertex-connectivity of a distance-regular graph
• The connectivity of strongly regular graphs
• Certain distance-regular digraphs and related rings of characteristic 4
• Distance-regular digraphs of girth 4
• A directed graph version of strongly regular graphs
• Distance-transitive and distance-regular digraphs
• Algebraic characterizations of distance-regular graphs
• Weakly distance-regular digraphs.
• Eigenvalues and perfect matchings
• On the superconnectivity of generalized \(p\)-cycles
• Weakly distance-regular digraphs
• Strongly regular graphs, partial geometries and partially balanced designs
• Maximally connected digraphs
• Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs
• Digraphs

This page was built for publication: Minimum cuts of distance-regular digraphs