An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph

From MaRDI portal

(Redirected from An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_inequality_relating_the_order,_maximum_degree,_diameter_and_connectivity_of_a_strongly_connected_digraph&oldid=66354249"