## Congressus Numerantium, Volume 142 |

### 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 g418 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 An,k Antk arrangement graphs assume attraction point automorphism group bipartite graphs blocking vertex CIAG circular-arc graph clause Combinatorial complete graph components compute CONGRESSUS NUMERANTIUM 142 connected graph consider construct contradiction cut set cycle denote directed 3-cycle directed graph dominating set eccentricity edge-connected eigenvalues Eulerian graph exactly example exists given graceful trees graph contains graph G GTDs Hence induced subgraph intersection graph interval graphs isomorphism types Konig-Egervary graph Lemma Let G Martin polynomial matrix maximal clique maximum number member of family minimum mode graph Neural Networks non-unit edges obtained odd-summand palindromes orbit orientation parameter path pendant edges perfect code players polygon problem Proof Proposition right endpoint round routing algorithm set of vertices Skolem sequences star graphs Subcase subgroup subset summands Suppose t-interval Theorem tournament designs unit edges vertex visibility graph x n grids