Abstract
Directed and undirected graphs. A graph G= [X, U,f] is a combination of two sets of elementary figures, the set X of nodes x and the set U of edges u, and a function f defined on U, the incidence function. This assigns to each directed edge u ∈ U exactly one ordered pair of nodes xixk ∈X and to an undirected edge one unordered pair (Fig.).
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.
Editor information
Rights and permissions
Copyright information
© 1975 VEB Bibliographisches Institut Leipzig
About this chapter
Cite this chapter
Gellert, W., Gottwald, S., Hellwich, M., Kästner, H., Küstner, H. (1975). Graph theory. In: Gellert, W., Gottwald, S., Hellwich, M., Kästner, H., Küstner, H. (eds) The VNR Concise Encyclopedia of Mathematics. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-6982-0_37
Download citation
DOI: https://doi.org/10.1007/978-94-011-6982-0_37
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-011-6984-4
Online ISBN: 978-94-011-6982-0
eBook Packages: Springer Book Archive