Minimum orders of Eulerian oriented digraphs with given diameter
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4144019 (Why is no real title available?)
- APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
- Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
- Maximum diameter of regular digraphs
- Minimum graphs of specified diameter, connectivity and valence. II
- On the diameter of a graph
- Radius, diameter, and minimum degree
- The diameter of directed graphs
- The minimum order of n-connected n-regular graphs with specified diameters
- The minimum-order three-connected cubic graphs with specified diameters
Cited in
(4)
This page was built for publication: Minimum orders of Eulerian oriented digraphs with given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477806)