Topics in Graph Automorphisms and Reconstruction (London Mathematical Society Student Texts)
Publisher: Cambridge University Press
Published: March 24, 2003
Language: eng
Format: Hardcover
Number of pages: 172
ISBN-13: 9780521821513
Subjects: Calculus & mathematical analysis; Combinatorics & graph theory; Mathematical foundations; Reconstruction (Graph theory); Graph Theory; Mathematics; Science/Mathematics; Combinatorics; Graphic Methods; Mathematics / Probability; Automorphisms
First sentence: In these chapters a graph G = (V(G), E(G)) will consist of two disjoint sets: a nonempty set V = V(G) whose elements will be called vertices and a set E = E(G) whose elements, called edges, will be unordered pairs of distinct elements of V.