Constructing graphs with several pseudosimilar vertices or edges (Q1394823): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q640843 |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ulrike Baumann / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 04:11, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing graphs with several pseudosimilar vertices or edges |
scientific article |
Statements
Constructing graphs with several pseudosimilar vertices or edges (English)
0 references
25 June 2003
0 references
The graphs considered in this paper are finite, simple and undirected. Two vertices in a graph \(G\) are said to be similar if there is an automorphism of \(G\) mapping \(u\) to \(v\). Vertices \(u\), \(v\) are said to be removal-similar, if \(G-u\) and \(G-v\) are isomorphic graphs. If vertices \(u\), \(v\) are removal-similar but not similar, then \(u\) and \(v\) are called pseudosimilar. Pseudosimilarity of edges is similarly defined. One can consider sets of mutually pseudosimilar vertices and sets of mutually pseudosimilar edges of a graph \(G\). This paper gives a survey on methods for the construction of graphs with large sets of pseudosimilar vertices or edges. Moreover, some related problems are discussed, and open questions are stated.
0 references
automorphism
0 references