## The Journal of Combinatorial Mathematics and Combinatorial Computing: JCMCC., Volumes 40-43 |

### What people are saying - Write a review

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

### Contents

ucts ha and hla respectively Accordingly the girth of each graph is equal | 10 |

G 1arcregular graphs | 50 |

F542 v6 u2v2uv7u2vu8v2 | 51 |

Copyright | |

20 other sections not shown

### Common terms and phrases

2-factors adjacent algorithm antimagic square apply Theorem assume automorphism group B-array base block bipartite block design blocking set border array Cayley graph color column Combinatorial complete graph component Computer configuration conjecture connected construction contains contradiction Corollary critical graphs cubic graphs cycle decomposition defined deleted denote domination number dual EDC graphs edge-magic labeling elements example exists Figure finite function girth given graph G graph of order Graph Theory hash family Hence hole hull hypercubes implies induced induced subgraph integer isomorphic latin square Lemma length Let G major vertices Math matrix minimal covering design minimum nodes nonleaf number of vertices obtain orbit orthogonal pair parallel classes path polar spaces positive integer problem Proof Proposition quasirandom radius-0 sphere regular graphs result sequence sequence-tree solution Steiner triple systems subgraph subset super edge-magic supermagic Suppose tree upper bound values vertex vertex set weight