## Congressus Numerantium, Volumes 142-143 |

### What people are saying - Write a review

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

### Contents

Perfect Codes and Independent Dominating Sets | 7 |

An Improved Upper Bound on gW18 by R G Stanton | 29 |

Gracefully Labeled Trees from Skolem Sequences by David Morgan | 41 |

Copyright | |

13 other sections not shown

### Common terms and phrases

2-split graph a++-stable adjacent assume automorphism group boundary Catalan chordal chordal graphs complete graph Computer CONGRESSUS NUMERANTIUM connected graph consider construct contains contradiction Corollary cycle defined denoted designs eigenvalues encoding Eulerian example exists fi(G Figure finite form an optimal function genetic algorithm geodominating set geodomination number given graph G Hence independent set induced subgraph integer intersection graph interval graphs isomorphic iteration knight's tour Konig-Egervary graphs labelling lattice path Lemma Let G Martin polynomial matrix maximal cliques mode graph networks nodes NP-complete odd-summand palindromes optical orthogonal codes orientation pair palindromes partition pendant edges perfect code permutation code points position problem processor Proof Proposition Prufer code quadruples regular bipartite graphs representation set of G Sheffer sequence Skolem sequences solution star graphs step subset subtrees summands Suppose t-interval Theorem tournament triangle triples Type values vertex vertices of G