Average distance in bipartite tournaments.

zbMATH Open1174.05050MaRDI QIDQ3624976FDOQ3624976

Authors: Peter Dankelmann, Lutz Volkmann 

Publication date: 6 May 2009

Recommendations

• Average distance in \(k\)-connected tournaments.
• The average connectivity of a digraph
• On average distance in tournaments and Eulerian digraphs
• Minimum average distance of strong orientations of graphs
• Proximity and remoteness in directed and undirected graphs

zbMATH Keywords

average distancestrong digraphstrong bipartite tournament

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Average distance in \(k\)-connected tournaments.
• On average distance in tournaments and Eulerian digraphs
• Minimum average distance of strong orientations of graphs

This page was built for publication: Average distance in bipartite tournaments.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624976)