Skip to main content
Log in

On the Determination Problem for P 4-Transformation of Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove that the P 4-transformation is one-to-one on the set of graphs with minimum degree at least 3, and if graphs G and G ' have minimum degree at least 3 then any isomorphism from the P 4-graph P 4(G) to the P 4-graph P 4(G ') is induced by a vertex-isomorphism from G to G ' unless G and G ' both belong to a special family of graphs.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aldred, R.E.L., Ellingham, M.N., Hemminger, R.L., Jipsen, P.: P 3-isomorphisms for graphs. J. Graph Theory 26, 35–51 (1997)

    Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, MacMillan/Elesevier. London/New York, 1976

  3. Broersma, H.J., Hoede, C.: Path graphs. J. Graph Theory 13, 427–444 (1989)

  4. Grünbaum, B.: Incidence patterns of graphs and complexes. Lecture Notes in Mathematics (eds. G. Chartrand, S.F. Kapoor) 110, 115–128 (1969)

  5. Hemminger, R.L., Beineke, L.W.: Line graphs and line digraphs. In: Beineke, L.W., Wilson, R.J. eds. Selected Topics in Graph Theory, Academic Press, London, New York, San Francisco, 1978

  6. Jung, H.A.: Zu einem isomorphiesatz von H. Whitney für graphen. Math. Ann. 164, 270–271 (1966)

  7. Li, H., Lin, Y.: On the charaterization of path graphs. J. Graph Theory 17, 463–466 (1993)

    Google Scholar 

  8. Li, X.: Isomorphisms of P 3-graphs. J. Graph Theory 21, 81–85 (1996)

    Google Scholar 

  9. Li, X.: On the determination problem for P 3-transformation of graphs. Ars Combinatoria 49, 296–302 (1998)

    Google Scholar 

  10. Li, X., Zhao, B.: Isomorphisms of P 4-graphs. Australasian J. Combinatorics 15, 135–143 (1997)

    Google Scholar 

  11. Li, X., Zhao, B.: Isomorphisms of P k -graphs for k ≥ 4. Discrete Math. 289, 71–80 (2004)

    Google Scholar 

  12. Prisner, E.: The dynamics of the line and path graph operators. Graphs and Combinatorics 9, 335–352 (1993)

    Google Scholar 

  13. Prisner, E.: A common generalization of line graphs and clique graphs. J. Graph Theory 18, 301–313 (1994)

    Google Scholar 

  14. Prisner, E.: Line graphs and generalizations — a survey. In: Surveys in Graph Theory (G. Chartrand, M. Jacobson eds.) Congressus Numerantium 116, 193–230 (1996)

  15. Prisner, E.: Bicliques in graphs. II. Recognizing k-path graphs and underlying graphs of line digraphs. Graph-Theoretic Concepts in Computer Science (Berlin, 1997), 273–287, Lecture Notes in Comput. Sci., 1335, Springer, Berlin, 1997

  16. Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica 20(1), 109–117 (2000)

    Google Scholar 

  17. Prisner, E.: Recognizing k-path graphs. Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997), Discrete Appl. Math. 99, 169–181 (2000)

  18. Van Bang Le, Prisner, E.: Iterated k-line graphs. Graphs and Combinatorics 10, 193–203 (1994)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xueliang Li.

Additional information

Supported by NSFC, PCSIRT and the “973” program.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, X., Liu, Y. On the Determination Problem for P 4-Transformation of Graphs. Graphs and Combinatorics 24, 551–562 (2008). https://doi.org/10.1007/s00373-008-0808-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0808-6

Keywords

Navigation