For any integerk e 1 thek- path graph Pk (G) of a graph G has all length-k subpaths ofG as vertices, and two such vertices are adjacent whenever their union (as subgraphs ofG) forms a path or cycle withk + 1 edges. Fork = 1 we get the well-known line graphP 1 (G) =L(G). Iteratedk-path graphs Pt k(G) are defined as usual by Pt k (G) := Pk(P t−1 k(G)) ift < 1, and by P1 k(G): = Pk(G). A graph G isP k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP k -converges if some iteratedk-path graph of G isP k -periodic. A graph has infiniteP k -depth if for any positive integert there is a graphH such that Pt k(H) ≃G. In this paperP k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP k -converges if some iteratedk-path graph of G isP k -periodic graphs,P k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP k -converges if some iteratedk-path graph of G isP k -convergent graphs, and graphs with infiniteP k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP k -converges if some iteratedk-path graph of G isP k -depth are characterized inside some subclasses of the class of locally finite graphs fork = 1, 2.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Beineke, L.W.: Characterizations of derived graphs. J. Comb. Theory9, 129–135 (1970)
Broersma, H.J., Hoede, C.: Path graphs. J. Graph Theory13, 427–444 (1989)
Ghirlanda, A.M.: Osservazioni sulle caratteristiche dei graft o singrammi. Ann. Univ. Ferrara Nuova Ser., Sez. VII11, 93–106 (1962-65)
Ghirlanda, A.M.: Sui graft ftniti autocommutabili. Boll. Unione Mat. Ital. III Ser.18, 281–284(1963)
Jung, H.A.: Zu einem Isomorphiesatz von H. Whitney für Graphen. Math. Ann.164, 270–271 (1966)
Menon, V.V.: The isomorphism between graphs and their adjoint graphs. Can. Math. Bull.8, 7–15 (1965)
Menon, V.V.: On repeated interchange graphs. Amer. Math. Monthly73, 986–989 (1966)
Menon, V.V.: On repeated interchange graphs II. J. Comb. Theory Ser. B11, 54–57 (1971)
Ore, O.: Theory of graphs: American Mathematics Society Providence, Rhode Island 1962
Porcu, L.: Sui graft autocommutati. Inst. Lombardo Acad. Sci. Lett. Rend. A100, 665–677 (1966)
Prisner, E.: Iterated graph-valued functions. Preprint TU Berlin No. 232 1989
Prisner, E.: Graph dynamics. Monograph in preparation.
Sabidussi, G.: Existenz and Struktur selbstadjungierter Graphen Beitäge zur Graphen- theorie, Beiträge zur Graphentheorie, (H. Sachs, H.-J. Voß, H. Walther ed.) pp. 121–125. Teubner, Leipzig 1968
Sabidussi, G.: Existence and structure of self-adjoint graphs. Math. Zeitschrift104, 257–280 (1968)
Schwartz, B.L.: On interchange graphs. Pacific J. Math.27, 393–396 (1968)
Schwartz, B.L.: Infinite self-interchange graphs. Pacific J. Math.31, 497–504 (1969)
Schwartz, B.L., Beineke, L.W.: Locally infinite self-interchange graphs. Proc. Amer. Math. Soc.27, 8–12 (1971)
Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math.54, 150–168 (1932)
About this article
Cite this article
Prisner, E. The dynamics of the line and path graph operators. Graphs and Combinatorics 9, 335–352 (1993). https://doi.org/10.1007/BF02988321
- line graph
- path graph
- infinite graphs
- graph dynamics