## Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 14 |

### From inside the book

Results 1-3 of 54

Page 127

On the Reverse of a

Western Carolina University Introduction. Let Kn be the complete graph on n

vertices and assign a positive weight to each edge in *n. The weight of a

harmiltonian ...

On the Reverse of a

**Permutation*** Joseph B. Klerlein and A. Gregory StarlingWestern Carolina University Introduction. Let Kn be the complete graph on n

vertices and assign a positive weight to each edge in *n. The weight of a

harmiltonian ...

Page 129

The reverse of any

proposition follows immediately from the fact that each

begins with i. Proposition 2. Column (i+1) can be obtained from column i,l^i^n-l ...

The reverse of any

**permutation**in column i, l£if_n > is not in column i. Proof . Theproposition follows immediately from the fact that each

**permutation**in column ibegins with i. Proposition 2. Column (i+1) can be obtained from column i,l^i^n-l ...

Page 131

(n-2) !

begin with 21, in cell 2 the

with 2(U-tl), for k _^ 2. In pad of these cellt the

...

(n-2) !

**permutations**, maintaining lexicographic order. The permutat i ons in cell 1begin with 21, in cell 2 the

**permutations**begin with 23, and in cell k they beginwith 2(U-tl), for k _^ 2. In pad of these cellt the

**permutations**in them are obtained...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Pomeranee | 21 |

J Abrham A Kotzig and P J Laufer | 45 |

B A Anderson | 75 |

Copyright | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

2-extensors adjacent algorithm array assume bifactorization binary blocks cograph color column Combinatorial complete graph component Computing configuration CONGRESSUS NUMERANTIUM conjecture consider construction contains Corollary corresponding cosets cycle cyclic defined denote determine digraph directed graph disjoint distance edge of H elements embedded Eulerian circuit example exists Figure finite function given Goppa codes graph G Graph Theory Hence hypergraph idempotent implies induced subgraph inequalities integer intersection irreducible isomorphic k-subset Ker G labelled latin squares Lemma length Let G linear mapping Math Mathematics matrix matroid maximal maximum minimal minimum mission network nodes NP-complete obtained operations pair paper partition path perfect graphs permutation plane polynomial problem Proof prove PSDS quasigroup randomly bitraceable result satisfying sequence Southeastern Conference subgraph subset Suppose symmetric Theorem tiles tree triangle upper bound values variables vector vertex vertices