Large sets of pseudosimilar vertices (Q1923491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Large sets of pseudosimilar vertices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large sets of pseudosimilar vertices |
scientific article |
Statements
Large sets of pseudosimilar vertices (English)
0 references
4 May 1997
0 references
Two vertices in a graph \(G\) are said to be similar if there is an automorphism \(\alpha\) of \(G\) such that \(\alpha(u)=v\); \(u\), \(v\) are removal-similar if \(G-u\simeq G-v\), and pseudosimilar if they are removal-similar but not similar. This paper looks at some of the methods which have been employed to construct graphs with large sets of pseudosimilar vertices or edges.
0 references
automorphism
0 references
large sets
0 references
pseudosimilar vertices
0 references
