A Brief Historical Introduction to Euler's Formula for Polyhedra, Topology, Graph Theory and Networks

Autor/in	Debnath, Lokenath
Titel	A Brief Historical Introduction to Euler's Formula for Polyhedra, Topology, Graph Theory and Networks
Quelle	In: International Journal of Mathematical Education in Science and Technology, 41 (2010) 6, S.769-785 (17 Seiten)Infoseite zur Zeitschrift PDF als Volltext Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Zeitschriftenaufsatz
ISSN	0020-739X
Schlagwörter	Topology; Geometric Concepts; Mathematics; Theories; Graphs; Networks; Mathematical Formulas + Suchen Sie Ihr Suchwort? Topologie; Elementare Geometrie; Mathematik; Theory; Theorie; Grafische Darstellung; Mathematische Formel
Abstract	This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Konigsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included. (Contains 15 figures.) (As Provided).
Anmerkungen	Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site: http://www.tandf.co.uk/journals
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2017/4/10