Article contents
Graphs, groups and pseudo-similar vertices
Published online by Cambridge University Press: 09 April 2009
Abstract
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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1984
References
- 3
- Cited by