What Does graphs Mean
It is very important to determine, before analyzing the term graphs, its etymological origin, as it will allow us to know first-hand the reason for its current meaning. In this way we can make clear that this comes from the Greek word graph , graphein, which translates as "record or write."
This fact is what determines, for example, that today we use this concept as an indissoluble part of other terms to which it gives that aforementioned meaning that is related to writing. This would be the example of a pen that is an instrument that we use to write, a graphologist who is the person who is dedicated to determining the psychological qualities of someone through the writing that he performs, or the polygraph who is in charge of studying various forms of writing that are carried out secretly.
In linguistics , a graph is a unitary object of an abstract nature that encompasses the spellings that make up a letter. The word has Greek origin and means "image" or "drawing . "
For computer science and mathematics , a graph is a graphical representation of various points that are known as nodes or vertices , which are linked through lines that are called edges . By analyzing the graphs, the experts are able to know how the reciprocal relationships develop between those units that maintain some type of interaction.
In this sense we cannot ignore the fact that the first written document that we have about what graphs are was made in the 18th century, and more specifically in 1736, by Leonhard Euler. This was a mathematician and physicist, of Swiss origin, who stood out for being one of the most important figures of his time in the aforementioned subject.
Specifically, this author made an article based on the bridges that exist in the city of Kaliningrad. From them, and through what is the theory of graphs, he developed an exhibition about graphs and vertices that is based on the fact that it is impossible to return to the vertex that acts as a starting point without first not going through one of the edges twice.
Graphs can be classified in various ways according to their characteristics. Simple graphs , in this sense, are those that arise when a single edge manages to join two vertices. Complex graphs , on the other hand, have more than one edge in conjunction with the vertices.
On the other hand, a graph is connected if it has two vertices connected through a path. What does this mean? That, for the pair of vertices (p, r), there must be some path that allows us to get from p to r.
In contrast, a graph is strongly connected if the pair of vertices is connected through at least two different paths.
Furthermore, a simple graph can be complete if the edges are able to join all pairs of vertices, while a graph is bipartite if its vertices arise from the union of a pair of sets of vertices and if a series of terms.