## Ars Combinatoria, Volumes 62-63Department of Combinatorics and Optimization, University of Waterloo., 2002 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

Bose cycle graph for a NS1D0 3triangulation of order | 26 |

kGeodomination in Graphs by Raluca Muntean and Ping Zhang | 33 |

On cHadamard Matrices by Spencer P Hurd andDinesh G Sarvate | 49 |

Copyright | |

19 other sections not shown

### Other editions - View all

### Common terms and phrases

1-factorization 3-triangulation 5-GDD of type adjacent anti-Pasch assume blocks Bruijn sequences cells claw-free graph color column combinatorial competition graph complete bipartite graphs complete graph complete set components condition conjecture connected graph consider construction contradiction Corollary cycle define degree denote digraph disjoint distinct dominating edge of G edge sum elements equivalent exactly exists a 5-GDD f+(G fc-geodominating Figure finite forcing geodetic number g-set geodetic set geodominating graph G graph of order Graph Theory Hence hypercubes implies incidence structure induced subgraph integer isomorphic latin squares least Lemma length Let G Math matrix NS1D0 sequences obtain orthogonal pair parameters partition regular path planar graph polynomial positive integers problem proof of Theorem Proposition prove result rim vertices satisfies set of G signed graph Skolem arrays split Steiner triple systems subgraph of G Suppose transversal covers unique g-set containing upper forcing geodetic vertices of G