Name
Abstract | ||
|---|---|---|
Let G and H be two graphs with the same vertex set V . It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H . We study the problem of finding the minimum number of 2-switches for transforming G into H . |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-89550-3_3 | KyotoCGGT |
Keywords | Field | DocType |
transforming graphs,degree sequence,graph g,minimum number,graph h | Discrete mathematics,Combinatorics,Graph power,Bound graph,Vertex (graph theory),Neighbourhood (graph theory),Cycle graph,Regular graph,Degree (graph theory),Mathematics,Complement graph | Conference |
Volume | ISSN | Citations |
4535 | 0302-9743 | 2 |
PageRank | References | Authors |
0.44 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergey Bereg | 1 | 245 | 40.81 |
| Hiro Ito | 2 | 290 | 39.95 |