Dense bipartite digraphs

DOI10.1002/jgt.3190140608zbMath0725.05044OpenAlexW1992835663MaRDI QIDQ5203051

J. Luis A. Yebra, Miquel Àngel Fiol

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140608

zbMATH Keywords

diameterout-degreebipartite digraphs

Mathematics Subject Classification ID

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

Related Items (14)

Spanners of de Bruijn and Kautz graphs ⋮ Large \((d,D, D',s)\)-bipartite digraphs ⋮ Multipartite Moore digraphs ⋮ Diameter vulnerability of iterated line digraphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ Bus interconnection networks ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ A line digraph of a complete bipartite digraph ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Large generalized cycles ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ On the acyclic disconnection and the girth

Cites Work

• Algebraic Graph Theory
• Unnamed Item

This page was built for publication: Dense bipartite digraphs