Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T15:33:19.606Z Has data issue: false hasContentIssue false

Attaching graphs to pseudo-similar vertices

Published online by Cambridge University Press:  09 April 2009

W. L. Kocay
Affiliation:
Department of Computer Science University of Manitoba Winnipeg, MahitobaCanadaR3T 2N2
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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).

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984