On the cycle-isomorphism of graphs

This paper considers conditions ensuring that cycle-isomorphic graphs are isomorphic. Graphs of connectivity ≥2 that have no loops were studied by Whitney and Truemper. Here were characterize all graphs G of connectivity 1 such that every graph that is cycle-isomorphic to G is also isomorphic to G

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  H. Whitney.  2-Isomorphic Graphs , 1933 .

[3]  Klaus Truemper,et al.  On Whitney's 2-isomorphism theorem for graphs , 1980, J. Graph Theory.

[4]  M. Watkins.  Connectivity of transitive graphs , 1970 .

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.