1.1 Graphs, subgraphs and factors: A graph G is a pair G = (V,E) consisting of a finite2 set V = ∅ and a set E of two-element subsets of V . The elements of V are called vertices. An element e = {a, b} of E is called an edge with end vertices a and b. We say that a and b are incident with e and that a and b are adjacent or neighbors of each other, and write e = ab or a e — b
CITATION STYLE
Basic Graph Theory. (2005). In Graphs, Networks and Algorithms (pp. 1–31). Springer-Verlag. https://doi.org/10.1007/3-540-26908-8_1
Mendeley helps you to discover research relevant for your work.