O'Reilly logo

Enumerative Combinatorics, Second Edition by Richard P. Stanley

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Appendix

Graph Theory Terminology

The number of systems of terminology presently used in graph theory is equal, to a close approximation, to the number of graph theorists. Here we describe the particular terminology that we have chose to use throughout this book, though we make no claims about its superiority to any alternate choice of terminology.

A finite graph is a triple G = (V, E, ϕ), where V is a finite set of vertices, E is a finite set of edges, and ϕ is a function that assigns to each edge e a 2-element V multiset of vertices. Thus, image. If ϕ(e) = {u, v}, then we think of e as 2 joining the vertices u and v. We say that u and v are adjacent ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required