Graph Theory and Finite Combinatorics |
Contents
Introduction | 1 |
Graph Theory and Finite Relations 1 Relations | 4 |
Digraphs | 11 |
Copyright | |
25 other sections not shown
Common terms and phrases
adjacent applications arcs Axiom block design called Cayley diagram Chapter characterization classes closed color column complete components concepts conjecture connected consisting construct contains Corollary corresponding cycle cyclic defined describe determinant difference set digraph directed distinct eigenvalues elements entry equal equivalent exactly example existence face factors finite four functional G₁ G₂ give given graph G graph theory graphical implies incidence isomorphic labeled Latin squares lattice least Lemma length lines Markov chain Math mathematical matrix MICHIGAN obtain opinion oriented orthogonal Latin squares pair path planar plane of order points positive prime problem projective plane proof proved provides relagraph relation represent representation satisfy shown in Figure spanning squares of order strong structure subgraph subsets symmetric Theorem topology tournament transitive tree triple walk written zero