#### Abstract

Graphs are essential tools to illustrate relationships in given datasets visually. Therefore, generating graphs from another concept is very useful to understand it comprehensively. This paper will introduce a new yet simple method to obtain a graph from any finite affine plane. Some combinatorial properties of the graphs obtained from finite affine planes using this graph-generating algorithm will be examined. The relations between these combinatorial properties and the order of the affine plane will be investigated. Wiener and Zagreb indices, spectrums, and energies related to affine graphs are determined, and appropriate theorems will be given. Finally, a characterization theorem will be presented related to the degree sequences for the graphs obtained from affine planes.

#### 1. Introduction

In this section, we start with some definitions and fundamental notions regarding affine planes from [1].

*Definition 1. *An affine plane is an ordered pair which we call the elements of as points and the elements of as lines, with the following properties:(A1)Any two distinct points lie on a unique line(A2)For each point not on a line , there is exactly one line passing through such that is parallel to (A3)There exists a set of three noncollinear points.The lines and are called as parallel if or , and we denote this byCondition (A2) is also called as *parallel axiom*.

If is a finite set, then the affine plane is called as *finite affine plane*.

Let us suppose is an affine plane. We know from [1] that, in the affine planes, the number of points on each line is the same. Letting be the number of points per line in , we call the *order* of . Accordingly any point is on lines.

If has order , then(1) has points(2)Each line is parallel to lines(3) has lines(4)Each line meets other lines(5)There are parallel classes

*Example 1. *In [1], it is shown that the smallest affine plane has four points and six lines and is described synthetically asThe lines can be grouped into three sets of parallel lines: is the affine plane presented in Figure 1.

When a finite affine plane is given, there is a number as the order. However, for a given number , it is not necessary to have an affine plane of order . It is a matter of ongoing studies that whether or not there are affine planes in which order.

Let us now recall some fundamental notions of graph theory from [2–6] to make the paper more self-contained.

Let be a multigraph with order and size , defined as the number of vertices and the number of edges, respectively. Let and be two vertices in graph . If is an edge, then it can be written as , and the vertices and are called as *adjacent vertices * and so *the ends of e*. The edge is said to be incident with and . An edge with identical ends is called a *loop*, and an edge with distinct ends a *link*. Two or more links with the same pair of ends are said to be *parallel edges*.

A graph is called *simple* if it has neither loops nor parallel edges. During this work, we are going to deal with simple graphs.

A graph is said to be *regular* if every vertex in has the same degree. More precisely, is said to be *k-regular* if for each vertex in , where . *Adjacency matrix * of defined as follows: , whereObviously, is a symmetric matrix with zero diagonal; entries consist of 0’s and 1’s. The eigenvalues of are the roots of the *characteristic polynomial *, so they are algebraic integers. The characteristic polynomial of is denoted by .

*Definition 2. *The spectrum of a finite graph is the spectrum of the adjacency matrix , that is, its set of eigenvalues together with their multiplicities.

The eigenvalues represented as , and unless we indicate otherwise, we shall assume that . If has distinct eigenvalues with multiplicities , respectively, we shall write for the spectrum of .

Let be a graph with vertices and edges . The *energy ** of * is defined bywhere are the eigenvalues of .

A topological index related to a graph is a real number that must be a structural invariant. The topological indices are important for numerical relationships with the structure.

*Definition 3. *Let be a graph with vertex set and edge set . The distance between two vertices is the minimum number of edges on a path in between and . The Wiener index of is defined byThe distance of a vertex is the sum of all distances between and all other vertices of . Thus, we can define the Wiener index as below:Two of the most useful topological graph indices are the *first and second Zagreb indices* which have been introduced by Gutman and Trinajstic in [7]. They are denoted by and and were defined asrespectively.

#### 2. The Relation of Graphs with Finite Affine Planes

Affine planes are one of the fundamental examples of incidence geometry. Considering the interpretation of graphs to social sciences and their application to network technologies, with the regularity and parallelism classes of affine planes, it is an interesting issue to obtain graphs from affine planes as one of the transitionalities that can yield results that are most logical and suitable for real-life practices.

We are going to be in an investigation for the answer to the following question: what if someone perceives the lines of a geometric structure as an element of graph theory and what could be obtained from this? To do so, we are introducing a new perspective. In this study, we work only with finite affine planes.

##### 2.1. The Method of Obtaining Graphs from Finite Affine Planes

In this part, a method will be presented to obtain a graph from a given finite affine plane. We note that obtaining a graph from a finite affine plane , which itself is already a graph , is pointless, but still the method we are going to introduce remains valid for such affine planes.

*Definition 4. *(1) Let be a finite affine plane of order . If is a line, then it must have points. We take this line as an ordered -tuple . It is obvious that . We establish a new set “” for any line in such that if , then , and we defineand if , then first we defineand secondThroughout this paper is called as ordered k-gon corresponding to line when .

If we try to obtain a graph from a finite affine plane , then we have to change our perception of lines. To do so, we use the method introduced in Definition 4.

Let us consider a line . If , for , any point is incident with only and .

For a line , if , can be considered as a . Also, we know that a is often called a , a is a , a is a , a is a , and so on.

In the following theorem, we obtain a graph from a finite affine plane of any order by considering every element of obtained for a line , as an edge. It is obvious that every element of obtained from is a set of exactly two points.

Theorem 1. *If is a finite affine plane of order , then we have a graph such that*

*Proof. *For any line , it is trivial that and every set consists of exactly 2 vertices.

Let be distinct elements. From (A1), there exists only one linepassing through the points and . Therefore, for , there existsin . Since , we take without loss of generality.

When *t* = *r* + 1, there is an edge,incident with and . In other words, when , there is only one edge passing through and and that is .

When if and , then there is an edge,incident with and . In other words, when if and , there is only one edge passing through and and that is .

In other cases, it is obvious from the construction of that there is no edge incident with and . Thus, we show that is a graph.

Throughout this work, we are going to use the method introduced by Theorem 1 to obtain a graph from a finite affine plane unless otherwise noted.

We should point out that we have already developed a new and different algorithm to create a new graph generating system from various incidence structures.

Corollary 1. *If is a finite affine plane of order and the graph is obtained from , then if and only if is the smallest affine plane.*

*Proof. *We know that if graph is obtained from , thenFirstly, let us assume . For every line of , if , then we have an ordered k-gon corresponding to that which causes a differentiation (an increase on the number of edges) between the number of edges of and the number of lines of . For that reason, must be 2 for every line of . It means that is the affine plane of order 2 which is the smallest one.

Secondly, let us assume is the smallest affine plane. For every line of , we know that . From Definition 4, we always get the condition which implies for every line, and we get the resultSince , we obtain

Corollary 2. *For a graph which is obtained from an affine plane ,*

*Proof. *From Theorem 1, we know thatIf , then since .

We found thatsince the equality of ordered pairs dictates one by one equality.

If there were no condition in Theorem 1, then the equality of and would not imply the equality of and .

*Definition 5. *A graph obtained from an affine plane of order is called as “affine graph of order corresponding to ,” or if there will not be any confusion, “affine graph of order ” can be used.

Now, we will examine how affine graphs are obtained when the affine plane of order 2 and the affine plane of order 3 is taken as .

*Example 2. *We are going to investigate the graph obtained from the smallest affine plane given in Example 1.

In this situation, as a result of Corollary 1 and Corollary 2, we do not need to make any further arrangement for the set of the points and lines because the smallest affine plane is also a graph itself:where is a graph and has 4 vertex and edges. If we determine the vertex degrees for each vertex, we obtainThus, is a -regular graph (cubic graph) with the degree sequence as above.

Adjacency matrix for is given below:where has spectrum and the energy of is .

The Wiener index of isZagreb indices of is

*Example 3. *Let us take the affine plane of order 3 with points and lines given, respectively,and illustrated by Figure 2.

With the method given earlier, we know that . Every given line in this affine plane of order 3 consists of 3 elements. So, is in every step of obtaining . In other words, every line of this affine plane considered as an ordered 3-gon which is denoted as in graph theory. See Figure 3.

The vertex and edge sets of the graph that is obtained from the affine plane of order 3 are as follows:where is a graph and has 9 vertex and edges. If we determine the vertex degrees for each vertex, we obtainThus, is a -regular graph with the degree sequence as above. Adjacency matrix for is given below:where has spectrum and the energy of is . See Figure 4.

The Wiener index of isZagreb indices of is

*Example 4. *Let us take the affine plane of order 4 with points and lines given, respectively:With the method given earlier, we know that . Every given line in this affine plane of order 4 consists of 4 elements. So, is in every step of obtaining . In other words, every line of this affine plane is considered as an ordered 4-gon, which is denoted as in graph theory. The vertex and edge sets of the graph that is obtained from the affine plane of order 4 are as follows:where is a graph and has 16 vertex and edges. If we determine the vertex degrees for each vertex, we obtainThus, is a -regular graph with the degree sequence as above. The adjacency matrix for is given below:where has spectrum and the energy of is . See Figure 5.

The Wiener index of isZagreb indices of isWhen we obtain the affine graph for the affine plane of order 5, the affine graph of order 5, we calculate it as 25 vertex and 150 edges, and it is 12-regular. The adjacency matrix for this graph is given below.

The Wiener index for affine graph of order 5, namely, isZagreb indices of isAlso, it has spectrum and the energy of this graph is .

The results regarding the spectra and energies of affine graphs are consistent with the lower and upper boundaries, given for regular graphs in [8–10].

Corollary 3. *Affine graphs of order consist of vertices and edges.*

Now, we give a theorem and a corollary for the characterization of the graphs that are obtained from affine planes.

Theorem 2. *Affine graphs of order for are -regular and has the degree sequence in the following form:*

*Proof. *Let be an affine plane of order for and the graph is obtained from .

We know that, in affine planes of order , all lines has points and every point is exactly on distinct lines. As mentioned just before Theorem 1 for a point on a line , there are exactly two edges and for that .

The point is on exactly distinct lines, so if it is incident with two edges for every line, then we have edges incident with the vertex .

Therefore, every vertex in has the degree . There are vertices in since and . Thus, we haveas the degree sequence.

Theorem 3. *Let be an affine graphs of order for . The Wiener index for these graphs can be calculated as*

*Proof. *Proof can be done by following simple calculations.

Theorem 4. *Let be an affine graphs of order for . Zagreb indices for these graphs can be calculated as*

*Proof. *Proof can be done by the following simple calculations.

#### 3. Conclusion

With this study, we start giving some relations between the incidence structures and graph theory from our new perspective. It is easily seen that there are some differences and similarities between the affine graphs of order and the affine planes of order , although the relations between them have not been examined thoroughly yet.

There are also some open problems in this subject that we are constantly studying on and which we think we are going to be able to examine and answer in the future. Some of them are in the following paragraphs.

We know that it is possible to obtain *projective graphs* as the geometric structure shift to projective planes, from [11] and more from [12]. What is the relation between affine and projective graphs which have the same order? For example, how does the existence and absence of the parallel axiom in affine and projective planes affect the graphs that are obtained from these planes?

We know that an affine plane is obtained when a line, with the points, is thrown away from a projective plane. Under which conditions can we find an affine graph of order by deleting a , with the vertices, from a projective graph of order ?

We know that affine planes of order can be embedded into projective planes of order . Can affine graphs of order be embedded in projective graphs of order ?

How can we determine whether a given graph is an affine graph?

Is there a relation between the isomorphism of geometric structures and associated graphs?

How can we determine the chromatic index of affine graphs? Is there a relationship between the parallel groups of affine planes and the chromatic index of corresponding affine graphs?

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.