Skip to main content

Fundamentals of Line Digraphs

  • Chapter
  • First Online:
Line Graphs and Line Digraphs

Part of the book series: Developments in Mathematics ((DEVM,volume 68))

  • 748 Accesses

Abstract

As noted earlier, the study of line graphs as a topic of its own can be credited to Krausz in his 1943 paper. The line digraph counterpart was written by Harary and Norman and didn’t appear until 1960. In this chapter, line digraphs are defined, after which some of their elementary directed properties are established, including some involving connectedness, degrees, paths and cycles, and distance. This is followed by some of the nicest results on line digraphs that different greatly from their undirected counterparts: (1) non-isomorphic digraphs with isomorphic line digraphs, and (2) digraphs isomorphic to their line digraph.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. M. Aigner, On the line graph of a directed graph. Math. Zeitschr. 102, 56–61 (1967)

    Article  Google Scholar 

  2. J. S. Bagga, L.W. Beineke, A survey of line digraphs and generalizations, Discrete Math. Lett. 6 (2021), 68–93.

    Article  MathSciNet  Google Scholar 

  3. C. Balbuena, D. Ferrero, X. Marcote, I. Pelayo, Algebraic properties of a digraph and its line digraph. J. Interconn. Netw. 4, 377–393 (2003)

    Article  Google Scholar 

  4. R.A. Brualdi, Spectra of digraphs. Linear Algebra Appl. 432, 2181–2213 (2010)

    Article  MathSciNet  Google Scholar 

  5. M.A. Fiol, A.S. Lladó, The partial line digraph technique in the design of large interconnection networks. IEEE Trans. Comput. 41, 848–857 (1992)

    Article  MathSciNet  Google Scholar 

  6. M.A. Fiol, M. Mitjana, The spectra of some families of digraphs. Linear Algebra Appl. 423, 109–118 (2007)

    Article  MathSciNet  Google Scholar 

  7. F. Harary, R.Z. Norman, Some properties of line digraphs. Rend. Circ. Mat. Palermo (2) 9, 161–168 (1960)

    Google Scholar 

  8. R.L. Hemminger, On Whitney’s line graph theorem. Amer. Math. Monthly 79, 374–378 (1972)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Beineke, L.W., Bagga, J.S. (2021). Fundamentals of Line Digraphs. In: Line Graphs and Line Digraphs. Developments in Mathematics, vol 68. Springer, Cham. https://doi.org/10.1007/978-3-030-81386-4_10

Download citation

Publish with us

Policies and ethics