Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-13T04:23:38.790Z Has data issue: false hasContentIssue false
  • English
  • Français

Attaching graphs to pseudo-similar vertices

Part of: Graph theory Permutation groups

Published online by Cambridge University Press:  09 April 2009

W. L. Kocay
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).

MSC classification

Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.) 05C60: Isomorphism problems (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) 20B15: Primitive groups
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 36 , Issue 1 , February 1984 , pp. 53 - 58
Copyright
Copyright © Australian Mathematical Society 1984

References

[1]Babai, L., ‘Representation of permutation groups by graphs,’ Combinatorial theory and its applications. I, Colloquia Math. Soc. jános Bolyai 4, Ed. Erdös, P., Rényi, A., Sòs, V. (North-Holland, 1970).Google Scholar
[2]Babai, L., ‘On the abstract group of automorphisms’, Combinatorics, Temperley, H. N. V. (Cambridge Univ. Press, 1981).Google Scholar
[3]Bouwer, I. Z., ‘Section graphs for finite permutation groups’, J. Combinatorial Theory (B), 6 (1969), 378–386.CrossRefGoogle Scholar
[4]Bouwer, I. Z., ‘Section graphs for finite permutation groups’, The many facets of graph theory, Ed. Chartand, and Kapoor, , pp. 55–61 (Springer-Verlag, 1969).CrossRefGoogle Scholar
[5]Godsil, C. D. and Kocay, W. L., ‘Constructing graphs with pairs of pseudo-similar vertices,’ J. Combinatorial Theory (B), to appear.Google Scholar
[6]Godsil, C. D. and Kocay, W. L., ‘Graphs with three mutually pseudo-similar vertices,’, in preparation.Google Scholar
[7]Hall, M. Jr,, The theory of groups (Chelsea, New York, 1959).Google Scholar
[8]Kimble, R., Stockmeyer, P. and Schwenk, A., ‘Pseudo-similar vertices in graphs,’ J. Graph Theory 5 (1981), 171–181.CrossRefGoogle Scholar
[9]Kocay, W. L., ‘Some new methods in reconstruction theory’, Proceedings of the Ninth Australian Cobinatorial Conference (Springer-Verlag, to appear).Google Scholar
[10]Leon, J. S. and Vera, Pless, CAMAC 1979, symbolic and algebraic computation (Lecture Notes in Computer Science, Springer-Verlag, New York, 1979).Google Scholar