Abstract
A graph (undirected) can be defined as a pair (V, E) where V is a non-empty finite set and E is a family of distinct unordered pairs of distinct elements of V. Elements of V are called vertices and elements of E are called edges. A graph is normally represented schematically as points and lines joining some of these points. The points are associated with vertices of a graph, whereas, lines joining pairs of points are associated with its edges. Figure 1.1 shows a graph with 5 vertices and 6 edges, with {1,2,3,4,5} being its vertex set and {{1,2}, {2,3}, {3,4}, {3,5}, {1,5}} being a family of its edges. The number of vertices in a graph is called the order of the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Feinberg, V., Levin, A., Rabinovich, E. (1997). Discrete Mathematics Fundamentals. In: VLSI Planarization. Mathematics and Its Applications, vol 399. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5740-7_2
Download citation
DOI: https://doi.org/10.1007/978-94-011-5740-7_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6421-7
Online ISBN: 978-94-011-5740-7
eBook Packages: Springer Book Archive