Name
Abstract | ||
|---|---|---|
A permutation graph G^@p of a graph G (or generalized prism) is obtained by taking two disjoint copies of G and adding an arbitrary matching between the copies. For the parameters diameter, radius, average distance, connectivity and edge-connectivity, we compare the values of the parameter for G^@p and G. In particular, we show that if G has no isolates and is not 2K\"k for k odd, then there exists a permutation graph of G with edge-connectivity equal to its minimum degree. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(02)00870-1 | Discrete Mathematics |
Keywords | Field | DocType |
augmenting,generalized prism,connectivity,permutation graph | Graph theory,Existence theorem,Permutation graph,Discrete mathematics,Combinatorics,Disjoint sets,Graph power,Permutation,Distance,Cyclic permutation,Mathematics | Journal |
Volume | Issue | ISSN |
271 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
15 | 1.26 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne Goddard | 1 | 126 | 15.95 |
| Michael Raines | 2 | 31 | 4.70 |
| Peter J. Slater | 3 | 593 | 132.02 |