## Congressus Numerantium, Volume 146 |

### What people are saying - Write a review

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

### Contents

Norman J Pullman | 7 |

On TriangleFree Regular Graphs Containing A Cut Vertex by R S Rees | 29 |

Two Conjectures on the Index of Convergence of an Irreducible Boolean | 43 |

Copyright | |

9 other sections not shown

### Common terms and phrases

adjacency matrix algorithm antichain arcs are colored assume augmentation problem backward operations Beasley bijective characterization circular-arc graph clique column components Congressus Numerantium connecting edge contains contradiction copy exchange Corollary cover and partition cycle dc-subgraphs defined denote digon digraph Dk+i dominating set domination graph domination-compliance graphs elements entry exists file transmission forward operation graph G Graph Theory Hankel diagonal Hankel matrices Hence implies induced subgraph isomorphic L.B. and Pullman last copying vertex Lemma Linear Algebra Appl Linear Operators Lundgren Math matrix ranks monochromatic path monochromatic sink Multilinear Algebra n x n n-realizable numbers of non-isomorphic obtain optimal file transfer ovoids partition numbers path increment permutation matrix permutations planar posets Pullman reflexive digraph regular graphs result semigroup sequence sign pattern matrix single vertex split-stars star graphs strongly preserves supermagic Suppose tc(D Theorem 3.1 tournament matrices upper ideal upset path upset tournament