## Congressus Numerantium, Volume 132 |

### What people are saying - Write a review

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

### Contents

Minimal Edge Cuts to Induce Balanced Signed Graphs by David John | 5 |

Rectangle Number for Hypercubes and Complete Multipartite Graphs | 19 |

CliqueDecomposition NLCDecomposition and Modular Decomposition | 39 |

Copyright | |

8 other sections not shown

### Common terms and phrases

3+-nodes adjacent Algorithm bijection binary tree bipartite claw-free graphs Clique Problem clique-width codeword cograph Combinatorics communication delay component Computer Congressus Numerantium construction contains Corollary corresponding cwd(G defined denote diagonal diffusion walks digraph disjoint Dk[m domination number edge label edge of F edge-graceful edge-magic encoding exponential sums Figure graph G Hamiltonian cycle Hence induced subgraph induced subtree integer isomorphic labeled graph Latin squares left rotation left subtree Lemma Let G linear tree Makinen matrix modular decomposition n-node binary tree number of arcs number of vertices obtained outdegree pair Pallo partition of order path Pdist polygon positive integer processor Proof q/p-grid random graph Reed-Muller code reliability problem result right arm satisfies scheme of Lucas score set sequence signed graph start-time subset subtree of node sum-saturable Suppose symmetry tasks Theorem triangulation unlabeled upper bound vertex labels vertex set vertices with score visibility graphs Zerling zero