Name
Abstract | ||
|---|---|---|
A graph is focal if the stabiliser of every vertex x fixes exactly one edge not incident with x . It is shown that the problem of testing whether a connected bipartite grpah is focal has the same complexity as the graph isomorphism problem. Several other similar questions are also considered. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0012-365X(90)90063-N | Discrete Mathematics |
Keywords | Field | DocType |
graph isomorphism | Graph canonization,Discrete mathematics,Complete bipartite graph,Combinatorics,Edge-transitive graph,Graph property,Graph isomorphism,Graph homomorphism,Cycle graph,Voltage graph,Mathematics | Journal |
Volume | Issue | ISSN |
81 | 3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Imrich | 1 | 64 | 20.65 |
| G. Sabidussi | 2 | 8 | 2.32 |