Name
Abstract | ||
|---|---|---|
This paper introduces the problem of finding a permutation phi on the vertex set V(G) of a graph G such that the sum of the distances from each vertex to its image under phi is maximized. We let S(G) = max Sigma(vis an element ofV(G)) d(v,phi(v)), where the maximum is taken over all permutations phi of V(G). Explicit formulae for several classes of graphs as well as general bounds are presented. |
Year | Venue | Field |
|---|---|---|
2004 | ARS COMBINATORIA | Discrete mathematics,Graph,Combinatorics,Indifference graph,Golomb–Dickman constant,Chordal graph,Permutation,Mathematics |
DocType | Volume | ISSN |
Journal | 72 | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter J. Slater | 1 | 593 | 132.02 |
| Steven J. Winters | 2 | 12 | 6.33 |