## Graph theory and finite combinatorics |

### From inside the book

10 pages matching **incidence matrix** in this book

#### Page 178

#### Page 179

Where's the rest of this book?

Results 1-3 of 10

### What people are saying - Write a review

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

### Contents

Graph Theory and Finite Relations | 4 |

Colorability | 60 |

Mengerian Theorems | 72 |

Copyright | |

5 other sections not shown

### Common terms and phrases

1-factor adjacency matrix automorphism Axiom bipartite graph called characterization chromatic number column complete graph complete order concepts connected graph construct contains Corollary cubic graph cutpoints cycle graph defined difference set digraph disconnected disjoint eigenvalues elements endpoint Euler eulerian example finite projective planes Four Color Conjecture functional digraph given in Theorem graph G graph theory graphical Hadamard matrix Hall's theorem Hasse diagram implies incidence matrix indegree integer isomorphic labeled lattice Lemma lines of G Markov chain Menger's theorem minimum number number of lines number of points obtain oriented graph orthogonal Latin squares outdegree partial order partition path permutation group planar graph plane of order point set points of G polynomial problem proof properties Ramsey numbers relagraph relation represent satisfies shown in Figure spanning cycle spanning trees squares of order strong component structure subgraph subsets symmetric block design topology tournament transitive digraph walk zero