According to linguistics, a graph is a unitary and abstract object that encompasses the graphs of a letter.
A graph is a unitary object of an abstract nature that encompasses the graphs that make up a letter, according to what linguistics indicates about this concept. The word has Greek origin and means “image” or “drawing” .
It is very important to determine, before moving forward with the analysis of 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 it clear that it emanates from the Greek word grapho , graphein , which can be translated as “record or write.”
This fact is what determines, for example, that today we use the notion as an inseparable part of other terms to which it gives that aforementioned meaning that is related to writing. This would be the example of a pen , which is an instrument that we use to write; graphologist, which is a person who is dedicated to determining the psychological qualities of someone through the writing they do; or polygraph , which is responsible for studying various forms of writing that are carried out secretly.
The graph in mathematics and computer science
For computer science and mathematics , a graph is a graphic representation of various points known as nodes or vertices , which are joined by lines called edges . By analyzing graphs, experts are able to understand how 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 we have about what graphs are was made in the 18th century , and more specifically in the year 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 wrote 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 exposition 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 passing through some of the edges on two occasions.
Leonhard Euler analyzed the Kaliningrad bridges to develop his graph theory.
Classification according to its characteristics
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 union 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.
On the other hand, a graph is strongly connected if the pair of vertices is connected through at least two different paths.
A simple graph, furthermore, can be complete if the edges are capable of joining 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 conditions is met. conditions.