Article contents
Attaching graphs to pseudo-similar vertices
Published online by Cambridge University Press: 09 April 2009
Abstract
Vertices u and v of a graph G are pseudo-similar if G – u ≅ G – v, but no automorphisms of G maps u to v. Let H be a graph with a distinguished vertex a. Denote by G(u. H) and G(v. H) the graphs obtained from G and H by identifying vertex a of H with pseudo-similar vertices u and v, respectively, of G. Is it possible for G(u.H) and G(v.H) to be isomorphic graphs? We answer this question in the affirmative by constructing graphs G for which G(u. H)≅ G(v. H).
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1984
References
- 1
- Cited by