![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and lower bound for the remaining four subclasses.
1. Introduction
The energy of a graph is the sum of the absolute values of the eigenvalues of adjacency matrix of the graph. The concept first appeared in 1978 in [Citation7]. The term energy refers to molecular energy in quantum chemistry. The notation E(G) stands for the energy of the graph G. In this paper we mainly focus on the mathematical perspective of the energy functions of Möbius ladder graph and Prism graph rather than focusing their roles in quantum chemistry and molecular biology. The authors [Citation3] derived the energy functions of all connected cubic circulant graphs that are represented by only two family of classes namely Möbius ladder and Prism graphs. The lower and upper boundaries for the energy of Möbius ladder and Prism graphs can be improved by knowing the oblique asymptote of the energy functions for connected cubic circulant graphs and this is the main motivation for the authors. In this section, we introduce briefly the structure of the connected cubic circulant graphs and their energy functions.
1.1. Energies of connected cubic circulant graphs
Let A be a matrix of order n. Then we say that A is a circulant matrix if for all
where the subscripts are computed in modulo n, see [Citation5]. We call G as a circulant graph, if G is isomorphic to a graph whose adjacency matrix is circulant.
The Möbius ladder graph Ln for even is formed by an n-cyle graph such that each vertex is connected by an edge to the opposite vertex, see [Citation6, Citation8]. Let
be odd integer. The prism graph Pn consists of 2n vertices such that
and
form two n-cyles and there exist an edge
for
see [Citation8, Citation9].
The adjacency matrices of Möbius ladder and Prism graphs are both circulant. The first rows of their adjacency matrices [Citation12] are
respectively.
A graph for which is called non-hyperenergetic. Another interesting invariant, known as the asymptotic energy, is the
[Citation2, Citation10, Citation13].
Let be a circulant matrix. The eigenvalues of A are given by
where
is the
rooth of unity and
[Citation5, Citation8]. The eigenvalues of the Möbius ladder graph are
see [Citation8]. The closed formula for the energy of the Möbius ladder graph is given in [Citation3].
The family of all cubic, connected, and circulant graphs correspond to only two classes, namely the Prism graphs Pn where n is odd and and the Möbius ladder graph Ln where n is even and
[Citation1, Citation4]. In [Citation12] (see p. 25) it was shown that for odd n, the adjacency matrix of
is column equivalent to the adjacency matrix of Pn. It turns out that finding the algebraic expressions for Ln is equivalent to finding algebraic expressions for all cubic, connected, and circulant graphs.
Let be an even integer. Then the energy of Ln can be computed by one of the algebraic expressions that is stated in the following theorem. Note that the lower script” o” and” e” in qo and qe denote the odd and even integers respectively.
Theorem 1.1
([Citation3]). If is an integer, then
is given by
In [Citation12] (see p. 25) it was shown that for odd n, the adjacency matrix of is column equivalent to the adjacency matrix of Pn. Therefore, by replacing n with 2n in the energy of Ln the following theorem was stated.
Theorem 1.2
([Citation3]). If is an integer, then
is given by
2. Main result
The following theorem gives us the asymptotic energy of Möbius ladder.
Theorem 2.1.
Let Ln be a Möbius ladder graph for an even integer , the linear function
is the oblique asymptote of
Proof.
Note that see [Citation8]. This sum can be split as follows.
Let
where
and
Notice that as k goes from 1 to
the values of g1 become
and the Riemann sum for h1 is
where
is the width of each subinterval. Moreover, as n goes to infinity the domain of h1 becomes
and the limit of the Riemann sum is
Let
where
and
Notice that as k goes from 1 to
the values of g2 become
and the Riemann sum for h2 is
where
is the width of each subinterval. Moreover, as n goes to infinity the domain of h2 becomes
and the limit of the Riemann sum is
Therefore, if we denote the energy of
at infinity by
then
which completes the proof. □
Remark 2.2.
Note that the constant, 1.43599, in is one less than the constant of
computed in [Citation10].
Remark 2.3.
Note that for all
which shows that Möbius ladders are non-hyperenergetic. This was also shown in [Citation11], see Corollary 1.
Let and
where the superscript denotes the class of each functions. The lower and the upper bounds of the energy functions of the Möbius ladder graph is given in the following theorem. Note that
divides the energy functions of
into two classes and it turns out that
is an upper bound for I1 and a lower bound for I2.
Theorem 2.4.
If n > 4, then the ordering of the energy functions of Ln is as follows.
(1)
(1)
Proof.
We will prove that each consecutive pair of inequalities in the ordering is true.
Case 1.
We first show that Note that
for
so
hence
Therefore,
Case 2.
We will prove that Notice that for
we have
So if n > 4, then
and this implies the following inequality which is what we want to establish.
Case 3.
We show that is valid for n > 4. We know from Theorem 1 that if
then
(2)
(2)
For the simplicity of the estimation, let
then the algebraic expression
reduces to
and for all
we have the following estimation:
Therefore,
and this implies that
Case 4.
We show that holds for n > 4. Notice that if n > 4, then
and
that is
Using the Theorem 1, we have the following estimation.
Case 5.
We show that holds for n > 4. For simplicity, we let
If n > 4, then
and
so
Notice that
Substituting
and multiplying both sides by 16 in above inequality yields that
This inequality is equivalent to
since
and
Case 6.
Proving is similar to previous case, hence it is omitted. □
Remark 2.5.
The proof of Theorem 2.4 can also be done by Taylor expansion for the difference of each consecutive energy functions.
The graph of each energy functions in Theorem 1.1 along with the graph of when
and x > 4 can be seen in . The dash line is the graph of
The ordering of the graphs from top to down are
and
respectively. Since we are just interested in the discrete cases we immediately state the following corollary.
Corollary 2.6.
If is an even integer, then
The ordering of the energy functions of prism graph is derived from Theorem 2.4, Theorem 1.1 and Theorem 1.2 as follows
Therefore, someone can easily determine the boundaries of the energy of the prism graphs as given in the below corollary.
Corollary 2.7.
If is an odd integer, then
One of the interesting results that is derived directly from Theorem 2.4 is the comparison of the energies of Möbius ladder graphs and prism graphs as given in the next corollary.
Corollary 2.8.
If is integer, then the following holds
If
, then
If
or
, then
Disclosure statement
No potential conflict of interest was reported by the author(s).
References
- Andrea, H., Arnfried, K. (2004). Circular total colorings of cubic circulant graphs. J. Combin. Math. Combin. Comput. 49: 65–72.
- Blázquez-Sanz, D., Marín Arango, C. A. (2017). Closed and asymptotic formulas for energy of some circulant graphs. Linear Multilinear Algebra 65(6): 1073–1079.
- Bulut, A., Hacioglu, I. (2020). The energy of all connected cubic circulant graphs. Linear Multilinear Algebra 68(4): 679–685.
- Davis, G. J., Domke, G. S. (2002). 3-circulant graphs. J. Combin. Math. Combin. Comput 40: 133–142.
- Davis, P. J. (1979). Circulant Matrices. New York: Wiley.
- Guy, R. K., Harary, F. (1967). On the Möbius ladders. Can. Math. Bull. 10(4): 493–496.
- Ivan, G. (1978). The energy of a graph. Ber. Math. Statist. Sekt. Forsch-Ungszentram Graz. 103: 1–22.
- Norman, B. (1993). Algebraic Graph Theory. Cambridge: Cambridge University Press.
- Read, R. C., Wilson, R. J. (2004). An Atlas of Graphs. New York: Oxford University Press.
- Stevanović, D., Stanković, I. (2005). Remarks on hyperenergetic circulant graphs. Linear Algebra Appl. 400: 345–348.
- Walikar, H. B., Gutman, I., Hampiholi, P. R., Ramane, H. S. (2001). Non-hyperenergetic graphs. Graph Theory Notes New York 41: 14–16.
- Williams, G. (2014). Smith forms for adjacency matrices of circulant graphs. Linear Algebra Appl. 443: 21–33.
- Yan, W., Zhang, Z. (2009). Asymptotic energy of lattices. Phys. A: Stat. Mech. Appl. 388(8): 1463–1471.