Graph Theory and Finite Combinatorics |
Common terms and phrases
1817 LIBRARIES a₁ adjacency matrix Amer arcs automorphism Axiom bipartite graph C₁ called chromatic number column complete graph connected graph construct contains Corollary corresponding cubic graph cutpoints cycle graph defined difference set digraph disjoint eigenvalues elements equivalent Euler eulerian example Four Color Conjecture functional digraph G₁ G₂ given in Theorem graph G graph theory graphical Hadamard matrix Hasse diagram incidence matrix indegree isomorphic K₁ König's theorem labeled lattice Lemma lines of G Markov chain Math Menger's theorem MICHIGAN minimum number number of lines number of points obtain oriented graph orthogonal Latin squares outdegree partial order path permutation group planar graph plane of order point set points of G polynomial proof properties Ramsey numbers relagraph relation represent S₂ shown in Figure spanning cycle spanning trees squares of order strong component structure subgraph subsets symmetric block design topology tournament transitive digraph triple V₁ walk zero