## The Journal of Combinatorial Mathematics and Combinatorial Computing: JCMCC., Volumes 17-20 |

### What people are saying - Write a review

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

### Contents

On the set edgereconstruction conjecture by Lars Dovling Andersen Songkang Ding | 3 |

The Greatest Common Divisor Index of a Graph by Gary Chartrand Farrokh Saba | 11 |

Further Results On The Multiplier Conjecture For The Case n 2nJ | 27 |

Copyright | |

20 other sections not shown

### Common terms and phrases

3-connected A-factors adjacent algorithm assume bandwidth bipartite blocks blossom bound Cayley graphs chromatic number chromatic polynomials clique codewords color Combinatorial complete graph complete sets components conjecture connected consider construct contradiction Corollary covering design cycle cyclic decomposition defined denote determining set Discrete Math disjoint edge coloring elements exactly example exists Figure finite G contains given graph G graph of order Graph Theory greatest common divisor Hadamard matrices Hence hypercube hyperedge hypergraph incident induced induced subgraph intersection isomorphic labeled Latin squares least Lemma Let G linear matrices maximal maximum degree minimal minimum nodes obtained optimal orthogonal pair path permutation points polynomial positive integer problem processor Proof Proposition prove respectively result satisfies ScanQ schedule sequence split graph star graph subset super-simple Suppose tasks Theorem total chromatic tournaments tree triangle vector vertices of degree Z-cyclic