Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T19:50:37.034Z Has data issue: false hasContentIssue false

Graphs, groups and pseudo-similar vertices

Part of:Graph theory

Published online by Cambridge University Press:  09 April 2009

W. L. Kocay
Affiliation:
Department of Computer Science University of QueenslandSt. Lucia, Queensland, AustraliaDepartment of Computer Science University of ManitobaWinnipeg, ManitobaCanadaR3T 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 u0, u1, …, uk−1 of a graph X are mutually pseudo-similar if X − u0 ≌ X − u1 ≌ … ≌ X − uk−1, but no two of the vertices are related by an automorphism of X. We describe a method for constructing graphs with a set of k≥2 mutually pseudo-similar vertices, using a group with a special subgroup. We show that in all graphs with pseudo-similar vertices, the vertices are pseudo-similar due to the action of a group on the cosets of some subgroup.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984