Iterated Jump Graphs

MaRDI QIDQ6398199zbMATH OpenFDO

Authors Fran Herr, Legrand II Jones

Publication date 3 May 2022

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Abstract: The jump graph $J(G)$ of a simple graph $G$ has vertices which represent edges in $G$ where two vertices in $J(G)$ are adjacent if and only if the corresponding edges in $G$ do not share an endpoint. In this paper, we examine sequences of graphs generated by iterating the jump graph operation and characterize the behavior of this sequence for all initial graphs. We build on work by Chartrand et al. who showed that a handful of jump graph sequences terminate and two sequences converge. We extend these results by showing that there are no non-trivial repeating sequences of jump graphs. All diverging jump graph sequences grow without bound while accumulating certain subgraphs.

Recommendations

• On the planarity of iterated jump graphs
• scientific article; zbMATH DE number 2065935
• scientific article; zbMATH DE number 2197932
• scientific article; zbMATH DE number 2164010
• scientific article; zbMATH DE number 1439472

Cited in

(1)

• Monotonic star decomposition of Jump graph of cycles and even decomposition of Jump graph of complete bipartite graphs

This page was built for publication: Iterated Jump Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6398199)