Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected P3-graphs

Abstract

In the paper "Broersma and Hoede, Path graphs, J. Graph Theory 13 (1989) 427-444", the authors proposed a problem whether there is a triple of mutually nonisomorphic connected graphs which have an isomorphic connected P3-graph. For a long time, this problem remains unanswered. In this paper, we give it a negative answer that there is no such triple, and thus completely solve this problem.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…