Advertisement

Some properties of line digraphs

  • Frank Harary
  • Robert Z. Norman
Article

Keywords

Line Graph Single Cycle Line Incident Isomorphism Theorem Weak Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Berge,Theorie des graphes et ses applications, Paris, 1958.Google Scholar
  2. 2.
    F. Harary,The number of functional digraphs. Math. Annalen 138 (1959) 203–210.zbMATHCrossRefGoogle Scholar
  3. 3.
    D. König,Theorie der endlichen und unendlichen Graphen. Leipzig, 1936; reprinted New York, 1950.Google Scholar
  4. 4.
    J. Krausz,Demonstration nouvelle d'une théorème de Whitney sur les reseaux. Mat. Fiz. Lapok 50 (1943) 75–85.zbMATHMathSciNetGoogle Scholar
  5. 5.
    R. Z. Norman,A new proof of an isomorphism theorem for graphs. In process of publication.Google Scholar
  6. 6.
    H. Whitney,Congruent graphs and the connectivity of graphs. Amer. J. Math. 54 (1932) 150–168.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer 1960

Authors and Affiliations

  • Frank Harary
    • 1
    • 2
  • Robert Z. Norman
    • 1
    • 2
  1. 1.Ann ArborU. S. A.
  2. 2.HanoverU. S. A.

Personalised recommendations