Minimum orders of Eulerian oriented digraphs with given diameter

DOI10.1007/S10114-014-3194-4zbMATH Open1304.05077OpenAlexW1996632063MaRDI QIDQ477806FDOQ477806

Authors: Yoomi Rho, Byeong Moon Kim, Woonjae Hwang, 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

Recommendations

• The diameter of directed graphs
• Diameter and maximum degree in Eulerian digraphs
• The diameter of almost Eulerian digraphs
• Distance and size in digraphs
• Minimum Diameter of Diregular Digraphs of Degree 2

zbMATH Keywords

diameterEulerian digraphminimum orderoriented digraph

Mathematics Subject Classification ID

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

Cites Work

• Radius, diameter, and minimum degree
• Maximum diameter of regular digraphs
• Title not available (Why is that?)
• The diameter of directed graphs
• 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
• 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
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

Cited In (4)

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

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)