Average distance in bipartite tournaments.

MaRDI QIDQ3624976zbMATH OpenFDO

Authors Peter Dankelmann, Lutz Volkmann

Publication date 6 May 2009

zbMATH Keywords

average distancestrong digraphstrong bipartite tournament

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Average distance in \(k\)-connected tournaments.
• Minimum average distance of strong orientations of graphs
• On average distance in tournaments and Eulerian digraphs
• scientific article; zbMATH DE number 5115622 (Why is no real title available?)

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)