Minimum orders of Eulerian oriented digraphs with given diameter

DOI10.1007/s10114-014-3194-4zbMath1304.05077OpenAlexW1996632063MaRDI QIDQ477806

Woonjae Hwang, Yoomi Rho, Byeong Moon Kim, Byung Chul Song

Publication date: 10 December 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-3194-4

zbMATH Keywords

diameterEulerian digraphminimum orderoriented digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ Size of graphs and digraphs with given diameter and connectivity constraints

Cites Work

• Unnamed Item
• 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
• Radius, diameter, and minimum degree
• The diameter of directed graphs
• Minimum graphs of specified diameter, connectivity and valence. II
• On the diameter of a graph
• The minimum order of n-connected n-regular graphs with specified diameters
• The minimum-order three-connected cubic graphs with specified diameters
• Maximum diameter of regular digraphs
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

This page was built for publication: Minimum orders of Eulerian oriented digraphs with given diameter