Minimum arc-cuts of normally regular digraphs and Deza digraphs

DOI10.1016/j.disc.2022.112879zbMath1490.05100OpenAlexW4220930268WikidataQ114190533 ScholiaQ114190533MaRDI QIDQ2138973

Zhengyu Guo, Dongdong Jia, Geng Sheng Zhang

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112879

zbMATH Keywords

arc-connectivityarc-cutregular digraphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normally regular digraphs
• A directed graph version of strongly regular graphs
• Distance-transitive and distance-regular digraphs
• Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
• Eigenvalues and perfect matchings
• Minimum cuts of distance-regular digraphs
• Deza digraphs
• Maximally connected digraphs
• Deza graphs: A generalization of strongly regular graph
• Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs
• Spectral Theory and Analysis

This page was built for publication: Minimum arc-cuts of normally regular digraphs and Deza digraphs