Skip to main content
SpringerLink
Log in

Powers of graphs, line graphs, and total graphs

  • Conference paper
  • First Online:
Theory and Applications of Graphs

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

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. M. Behzad, A characterization of total graphs, Proceedings, Amer. Math. Soc. 26 (1970) 383–389.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Behzad and G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston (1971).

    MATH  Google Scholar 

  3. L. W. Beineke, Characterizations of derived graphs, J. Combinatorial Theory 9 (1970) 129–135.

    Article  MathSciNet  MATH  Google Scholar 

  4. G. Chartrand, A. D. Polimeni, and M. J. Stewart, The existence of 1-factors in line graphs, squares, and total graphs, Indagationes Mathematicae (A) 35 (1973) 228–232.

    Article  MathSciNet  Google Scholar 

  5. F. Escalante, L. Montejano, and T. Rojano, Characterization of n-path graphs and of graphs having nth root, J. Combinatorial Theory (B) 16 (1974) 282–289.

    Article  MathSciNet  MATH  Google Scholar 

  6. H. Fleischner, Über Hamiltonsche Linien im Quadrat kubischer und pseudokubischer Graphen, Mathematische Nachrichten 49 (1971) 163–171.

    Article  MathSciNet  MATH  Google Scholar 

  7. H. Fleischner, On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs, J. Combinatorial Theory (B) 16 (1974) 17–28.

    Article  MathSciNet  MATH  Google Scholar 

  8. H. Fleischner, The square of every two-connected graph is Hamiltonian, J. Combinatorial Theory (B) 16 (1974) 29–34.

    Article  MathSciNet  MATH  Google Scholar 

  9. H. Fleischner and A. M. Hobbs, A necessary condition for the square of a graph to be Hamiltonian, J. Combinatorial Theory (B) 19 (1975) 97–118.

    Article  MathSciNet  MATH  Google Scholar 

  10. H. Fleischner and A. M. Hobbs, Hamiltonian total graphs, Mathematische Nachrichten 68 (1975) 59–82.

    Article  MathSciNet  MATH  Google Scholar 

  11. D. P. Geller, The square root of a digraph, J. Combinatorial Theory 5 (1968) 320–321.

    Article  MathSciNet  MATH  Google Scholar 

  12. S. Goodman and S. Hedetniemi, Sufficient conditions for a graph to be Hamiltonian, J. Combinatorial Theory (B) 16 (1974) 175–180.

    Article  MathSciNet  MATH  Google Scholar 

  13. F. Harary and C. St. J. A. Nash-Williams, On Eulerian and Hamiltonian graphs and line graphs, Canad. Math. Bull. 8 (1965) 701–709.

    Article  MathSciNet  MATH  Google Scholar 

  14. F. Harary and A. Schwenk, Trees with Hamiltonian squares, Mathematika, London 18 (1971) 138–140.

    Article  MathSciNet  MATH  Google Scholar 

  15. A. M. Hobbs, Some Hamiltonian results in powers of graphs, J. Res. Nat. Bur. Standards Sect. B 77B (1973) 1–10.

    MathSciNet  Google Scholar 

  16. A. M. Hobbs, Maximal Hamiltonian cycles in squares of graphs, J. Combinatorial Theory (B), to appear.

    Google Scholar 

  17. A. M. Hobbs, Hamiltonian squares of cacti, J. Combinatorial Theory (B), to appear.

    Google Scholar 

  18. J. J. Karaganis, On the cube of a graph, Canad. Math. Bull. 11 (1968), 295–296.

    Article  MathSciNet  MATH  Google Scholar 

  19. J. Krausz, Demonstration nouvelle d'une Theoreme de Whitney sur les Reseaux, Mat. Fiz. Lapok 50 (1943) 75–85.

    MathSciNet  MATH  Google Scholar 

  20. A. Mukhopadhyay, The square root of a graph, J. Combinatorial Theory 2 (1967) 290–295.

    Article  MathSciNet  MATH  Google Scholar 

  21. C. St. J. A. Nash-Williams, Problem No. 48, Theory of Graphs (P. Erdös and G. Katona, ed.), Academic Press, New York (1969).

    Google Scholar 

  22. F. Neuman, On a certain ordering of the vertices of a tree, Casopis Pest. Mat. 89 (1964) 323–339.

    MathSciNet  MATH  Google Scholar 

  23. M. D. Plummer, Private communication, 26 April 1971.

    Google Scholar 

  24. I. C. Ross and F. Harary, The square of a tree, Bell System Tech. J. 39 (1960) 641–647.

    MathSciNet  Google Scholar 

  25. M. Sekanina, On an ordering of the vertices of a graph, Casopis Pest. Mat. 88 (1963) 265–282.

    MathSciNet  MATH  Google Scholar 

  26. M. Sekanina, Problem No. 28, Theory of Graphs and its Applications (M. Fiedler, ed.), Academic Press, New York (1964), 164.

    Google Scholar 

  27. H. Walther, Über eine Anordnung der Knotenpunkte kubischer Graphen, Matematicky Casopis 19 (1969) 330–333.

    MathSciNet  MATH  Google Scholar 

  28. D. P. Sumner, Graphs with 1-factors, Proc. Amer. Math. Soc. 42 (1974) 8–12.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Texas A & M University, College Station, Texas, 77843, USA

    Arthur M. Hobbs

Authors
  1. Arthur M. Hobbs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hobbs, A.M. (1978). Powers of graphs, line graphs, and total graphs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070384

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation