On the cycle-isomorphism of graphs |
| |
Authors: | Xingxing Yu |
| |
Abstract: | This paper considers conditions ensuring that cycle-isomorphic graphs are isomorphic. Graphs of connectivity ? 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs G of connectivity 1 such that every graph that is cycle-isomorphic to G is also isomorphic to G. |
| |
Keywords: | |
|
|