Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected $P_3$-graphs

Simple item page
dc.creatorLi, Xueliang
dc.creatorLiu, Yan
dc.date2007-11-23
dc.date.accessioned2026-07-07T08:44:38Z
dc.date.available2026-07-07T08:44:38Z
dc.descriptionIn the paper "Broersma and Hoede, {\it Path graphs}, J. Graph Theory {\bf 13} (1989) 427-444", the authors proposed a problem whether there is a triple of mutually nonisomorphic connected graphs which have an isomorphic connected $P_3$-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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0711.3677
dc.identifierhttp://arxiv.org/abs/0711.3677
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142724
dc.subjectCombinatorics
dc.subject05C60
dc.titleNonexistence of triples of nonisomorphic connected graphs with isomorphic connected $P_3$-graphs
dc.typetext

Files

Collections

arXiv