Abstract
Graphs are mathematical structures that have many applications in computer science, electrical engineering, and more widely in engineering as a whole, but also in sciences such as biology, linguistics, and sociology, among others. For example, relations among objects can usually be encoded by graphs. Whenever a system has a notion of state and a state transition function, graph methods may be applicable. Certain problems are naturally modeled by undirected graphs whereas others require directed graphs. Let us give a concrete example.
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.
References
Claude Berge. Graphs and Hypergraphs. Amsterdam: Elsevier North-Holland, first edition, 1973.
Béla Bollobas. Modern Graph Theory. GTM No. 184. New York: Springer Verlag, first edition, 1998.
Reinhard Diestel. Graph Theory. GTM No. 173. New York: Springer Verlag, third edition, 2005.
Frank Harary. Graph Theory. Reading, MA: Addison Wesley, first edition, 1971.
Michel Sakarovitch. Optimisation Combinatoire, Méthodes mathématiques et algorithmiques. Graphes et Programmation Linéaire. Paris: Hermann, first edition, 1984.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gallier, J. (2011). Graphs, Part I: Basic Notions. In: Discrete Mathematics. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8047-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8047-2_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-8046-5
Online ISBN: 978-1-4419-8047-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)