Skip to main content
Log in

Minimum orders of eulerian oriented digraphs with given diameter

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

A digraph D is oriented if it does not contain 2-cycles. If an oriented digraph D has a directed eulerian path, it is an oriented eulerian digraph. In this paper, when an oriented eulerian digraph D has minimum out-degree 2 and a diameter d, we find the minimum order of D. In addition, when D is 2-regular with diameter 4m (m ≥ 2), we classify the extremal cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bhattacharya, D.: The minimum order of n-connected n-regular graphs with specified diameters. IEEE Trans. Circuits Syst. I. Regul. Pap., CAS-32, 407–409 (1985)

    Article  Google Scholar 

  2. Dankelmann, P.: The diameter of directed graphs. J. Combin. Theory Ser. B, 94, 183–186 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Engelhardt, E., Klee, V., Li, K., et al.: Minimum graphs of specified diameter, connectivity and valence. II. Discrete Math., 78, 257–266 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Erdös, P., Pach, J., Pollack, R., et al.: Radius, diameter and minimum degree. J. Combin. Theory Ser. B, 47, 73–79 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kim, B., Song, B., Hwang, W.: Classification of 2-regular digraphs with maximum diameter. Korean J. Math., 20, 247–254 (2012)

    Article  Google Scholar 

  6. Knyazev, A.: Diameters of Pseudosymmetric Graphs. Mat. Zametki, 41, 829–843 (1987) (In Russian; English translation: Math. Notes, 41, 473–482 (1987))

    MATH  MathSciNet  Google Scholar 

  7. Klee, V.: Classification and enumeration of minimum (d, 3, 3)-graphs for odd d. J. Combin. Theory Ser. B, 28, 184–207 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Klee, V., Quaife, H.: Minimum graphs of specified diameter, connectivity and valence. Math. Oper. Res., 1, 28–31 (1976)

    Article  MathSciNet  Google Scholar 

  9. Klee, V., Quaife, H.: Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs. J. Combin. Theory Ser. B, 23, 83–93 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Moon, J.: On the diameter of graph. Michigan Math. J., 12, 349–351 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  11. Myers, B.: The minimum-order three-connected cubic graphs with specified diameters. IEEE Trans. Circuits Syst. I. Regul. Pap., CAS-27, 698–709 (1980)

    Article  Google Scholar 

  12. Soares, J.: Maximum diameter of regular digraphs. J. Graph Theory, 16, 437–450 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Byung Chul Song.

Additional information

Supported by the University of Incheon Research Grant in 2009-2010

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rho, Y., Kim, B.M., Hwang, W. et al. Minimum orders of eulerian oriented digraphs with given diameter. Acta. Math. Sin.-English Ser. 30, 1125–1132 (2014). https://doi.org/10.1007/s10114-014-3194-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-014-3194-4

Keywords

MR(2010) Subject Classification

Navigation