Skip to main content

Line graphs of triangleless graphs and iterated clique graphs

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

Keywords

  • Bipartite Graph
  • Line Graph
  • Subgraph Isomorphic
  • Complete Subgraph
  • Clique Graph

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Beineke, Derived graphs and digraphs, Beiträge zur Graphentheorie, (H. Sachs, H. Voss, and H. Walther, eds.), Teubner, Leipzig, 1968, 17–33.

    Google Scholar 

  2. L. C. Chang, The uniqueness and nonuniqueness of the triangular association scheme, Sci. Record 3 (1959), 604–613.

    MathSciNet  MATH  Google Scholar 

  3. C. Cook, Graphs Associated with (0,1) Arrays, Ph.D. Thesis, Univ. of Iowa, 1970.

    Google Scholar 

  4. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.

    MATH  Google Scholar 

  5. S. Hedetniemi, Graphs of (0,1)-matrices, Recent Trends in Graph Theory, (M. Capobianco, J. B. Frechen, and M. Krolik, eds.), Springer-Verlag, Berlin, 1971, 157–172.

    CrossRef  Google Scholar 

  6. A. J. Hoffman, On the uniqueness of the triangular association scheme, Ann. Math. Statist. 31 (1960), 492–497.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. _____, On the line-graph of the complete bipartite graph, Ann. Math. Statist. 35 (1964), 883–885.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. J. Krausz, Démonstration nouvelle d'une theoreme de Whitney sur les réseaux, Mat. Fiz. Lapok 50 (1943), 75–89.

    MathSciNet  MATH  Google Scholar 

  9. J. Moon, On the line-graph of the complete bigraph, Ann. Math. Statist. 34 (1963), 664–667.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. A. van Rooij and H. Wilf, The interchange graphs of a finite graph, Acta Math. Acad. Sci. Hungar. 16 (1965), 263–269.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. N. Turri, Some observations on line-graphs, Boll. Un. Math. Ital. (3) 20 (1965), 181–184.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Hedetniemi, S.T., Slater, P.J. (1972). Line graphs of triangleless graphs and iterated clique graphs. 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/BFb0067365

Download citation

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

  • 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