Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected P₃-graphs

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0711.3677, https://eudml.org/doc/129769, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r31.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

connected generalized \(K_{3,3}\)-type isomorphic connected \(P_3\)-graph isomorphism path graph triple of mutually nonisomorphic connected graphs Whitney type

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Abstract: In the paper "Broersma and Hoede, {it Path graphs}, J. Graph Theory {�f 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.

Review text

Summary: In the paper ``Path graphs, \textit{H.J. Broersma} and \textit{C. Hoede} [J. Graph Theory 13, No.\,4, 427--444 (1989; Zbl 0677.05068)] posed the problem whether there is a triple of mutually nonisomorphic connected graphs which have an isomorphic connected \(P_3\)-graph. In this paper, we show that there is no such triple, and thus completely solve this problem.

Recommendations

Cited in

(3)

This page was built for publication: Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected \(P_{3}\)-graphs

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