Name
Abstract | ||
|---|---|---|
Let ( x , y ) be an edge of a graph G . Then the rotation of ( x , y ) about x is the operation of removing ( x , y ) from G and inserting ( x , y ′) as an edge, where y ′ is a vertex of G . The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H . Lower and upper bounds are given on the rotation distance of two graphs in terms of their greatest common subgraphs and their partial rotation link of largest cardinality. We also propose some extermal problems for the rotation distance of trees. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0012-365X(94)90258-5 | Discrete Mathematics |
Keywords | Field | DocType |
rotation distance | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Cardinality,Axis–angle representation,Mathematics | Journal |
Volume | Issue | ISSN |
126 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.89 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| R. H. Schelp | 2 | 609 | 112.27 |
| L. M. Lesniak | 3 | 44 | 8.23 |
| A. Gyárfás | 4 | 277 | 54.48 |
| J. Lehel | 5 | 391 | 75.03 |