Focality and graph isomorphism (Q913826)
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: Focality and graph isomorphism |
scientific article; zbMATH DE number 4148148
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Focality and graph isomorphism |
scientific article; zbMATH DE number 4148148 |
Statements
Focality and graph isomorphism (English)
0 references
1990
0 references
A graph is focal if the stabiliser of every vertex x fixed exactly one edge not incident with x. It is shown that the problem of testing whether a connected bipartite graph is focal has the same complexity as the graph isomorphism problem. Several other similar questions are also considered.
0 references
focal graphs
0 references
connected bipartite graph
0 references
graph isomorphism problem
0 references
