Skip to main content
SpringerLink
Log in

Line digraphs

  • Conference paper
  • First Online:
Graph Theory and Applications

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 303))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aigner, On the line-graph of a directed graph, Math. Z. 102 (1967), 56–61, MR36, #76.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Beineke, On derived graphs and digraphs, Beitrage zur Graphentheorie (Ed. H. Sachs, H. J. Voss, H. Walther), Teubner, Leipzig 1968, pp. 17–23.

    Google Scholar 

  3. A. Ghirlanda and L. Muracchini, Sui grafi segnati ed i grafi commutati, Statistica (Bologna) 25 (1965), 677–680, MR33, #7272.

    MathSciNet  Google Scholar 

  4. _____, Sul grafo commutato e sul grato opposto di un grafo orientato, Atti Sem. Mat. Fis. Univ. Modena 14 (1965), 87–97, MR33, #2570.

    MathSciNet  MATH  Google Scholar 

  5. B. Grünbaum, Incidence patterns of graphs and complexes, The Many Facets of Graph Theory, (G. Chartrand and S. F. Kapoor, ed.), Springer-Verlag, Berlin, 1969, 115–128, MR40, #4152.

    Chapter  Google Scholar 

  6. F. Harary, The number of functional digraphs, Math. Analen 138 (1959), 203–210, MR22, #18.

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Harary and R. Norman, Some properties of line digraphs, Rend. Circ. Mat. Palermo 9 (1960), 161–168, MR24, #A693.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Harary and D. Geller, Arrow diagrams are line digraphs, SIAM J. Appl. Math. 16 (1968), 1141–1145, MR38, #3179.

    Article  MathSciNet  MATH  Google Scholar 

  9. C. Heuchenne, Sur une certaine correspondence entre graphes, Bull. Soc. Rov. Sci. Liege 33 (1964), 743–753, MR30, #5297.

    MathSciNet  MATH  Google Scholar 

  10. P. Richards, Precedence constraints and arrow diagrams, SIAM Review 9 (1967), 548–553.

    Article  MATH  Google Scholar 

  11. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150–168.

    Article  MathSciNet  MATH  Google Scholar 

  12. C. Zamfirescu, Disconnected digraphs isomorphic with their line digraphs, Bollettino U.M.I. (4) 4 (1971), 888–894.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vanderbilt University, 37235, Nashville, TN

    Robert L. Hemminger

Authors
  1. Robert L. Hemminger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Y. Alavi D. R. Lick A. T. White

Rights and permissions

Reprints and permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Hemminger, R.L. (1972). Line digraphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067366

Download citation

  • DOI: https://doi.org/10.1007/BFb0067366

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06096-3

  • Online ISBN: 978-3-540-38114-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation