Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Maximum diameter of regular digraphs

From MaRDI portal
Publication:4020701
Jump to:navigation, search

DOI10.1002/JGT.3190160505zbMath0768.05048OpenAlexW2006485460MaRDI QIDQ4020701

No author found.

Publication date: 17 January 1993

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

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



zbMATH Keywords

diameterregular digraphs


Mathematics Subject Classification ID

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


Cites Work

  • An application of connectivity theory in graphs to factorizations of elements in groups


Related Items (9)

Formally verified algorithms for upper-bounding state space diameters ⋮ Capturing the drunk robber on a graph ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Distance and size in digraphs ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ The diameter of directed graphs ⋮ Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Size of graphs and digraphs with given diameter and connectivity constraints






This page was built for publication: Maximum diameter of regular digraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4020701&oldid=40679851"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 28 March 2025, at 09:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki