Graph theory
The mathematics of connection with everything else stripped away. A graph is just a set of points (vertices) and the links between them (edges); graph theory studies what follows from the pattern of links alone, ignoring distance, size, and shape.
गहरा अभिलेखागार फ़िलहाल अंग्रेज़ी में लिखा है — सत्यापित अनुवाद रोडमैप का हिस्सा हैं। आपके ब्राउज़र की अनुवाद सुविधा इस पृष्ठ पर अच्छी तरह काम करती है।
✦ अरे, सच में?
Euler settled the old parlor puzzle of whether you could stroll across all seven bridges of Königsberg exactly once — using no map and no measurement. The walk is impossible for one reason only: each of the four landmasses is met by an odd number of bridges, and any through-route can afford at most two odd endpoints, its start and its finish. The lengths of the bridges and the sizes of the islands never enter the argument. The word "graph" itself was not coined for another 142 years — by J. J. Sylvester, in 1878.
यह क्या है
A graph is the barest possible skeleton of a situation: dots for the things, lines for which things are joined. Königsberg sat on the river Pregel as four landmasses — two islands and two banks — tied together by seven bridges. In his 1736 paper *Solutio problematis ad geometriam situs pertinentis*, Euler threw away the city and kept the skeleton: four points, seven links, and one question about the pattern. Could you trace a walk that used every link exactly once? He proved you could not, and in proving it invented the idea that a shape can be studied purely as a web of connections.
यह क्यों महत्वपूर्ण था
It was the first theorem about pattern rather than magnitude. Every earlier geometry measured — lengths, angles, areas. Euler showed that a whole class of real questions depends on none of that, only on what touches what. This is the seed of two subjects at once: graph theory, the mathematics of networks, and topology, the "geometry of position" that studies properties surviving any stretch or bend. It also modeled a way of thinking: rather than try the routes one by one, Euler found an *invariant* — the parity of each landmass's bridge count — that decided the matter in a single stroke.
इसने क्या संभव किया
Everything defined by connection rather than distance is now a graph: road and rail networks, electrical circuits, the routing tables of the internet, molecules (Cayley and Sylvester drew chemical structures as graphs in the 1870s), family trees, and the link structure of the web. Graph theory gave us shortest-path and network-flow algorithms, the four-color theorem, the modeling of epidemics spreading across contact networks, and the eigenvector-of-a-graph idea behind Google's original PageRank. Whenever a problem reduces to "what is connected to what," it is Euler's Königsberg abstraction at work.
इस प्रविष्टि का पूरा वृत्तांत अभी प्रतीक्षित है — मानचित्रकार काम पर हैं। ग्राफ़ में इसका स्थान पहले ही सत्यापित है।
इसके लिए चाहिए
इससे खुला
सीमांत — आगे अभी कुछ अंकित नहीं।
इस पृष्ठ पर कुछ ग़लत दिखा? यहाँ का हर दावा चुनौती झेलने के लिए लिखा गया है। सुधार सुझाइए →