Integral Eigen-Pair Balanced Classes of Graphs with Their Ratio, Asymptote, Area, and Involution-Complementary Aspects

The association of integers, conjugate pairs, and robustness with the eigenvalues of graphs provides the motivation for the following definitions. A class of graphs, with the property that, for each graph (member) of the class, there exists a pair 𝑎,𝑏 of nonzero, distinct eigenvalues, whose sum and product are integral, is said to be eigen-bibalanced . If the ratio (𝑎 + 𝑏)/(𝑎 ⋅ 𝑏) is a function 𝑓(𝑛) , of the order 𝑛 of the graphs in this class, then we investigate its asymptotic properties. Attaching the average degree to the Riemann integral of this ratio allowed for the evaluation of eigen-balanced areas of classes of graphs. Complete graphs on 𝑛 vertices are eigen-bibalanced with the eigen-balanced ratio (𝑛 − 2)/(1 − 𝑛) = 𝑓(𝑛) which is asymptotic to the constant value of − 1. Its eigen-balanced area is (𝑛 − 1)(𝑛 − ln (𝑛 − 1)) —we show that this is the maximum area for most known classes of eigen-bibalanced graphs. We also investigate the class of eigen-bibalanced graphs, whose class of complements gives rise to an eigen-balanced asymptote that is an involution and the effect of the asymptotic ratio on the energy of the graph theoretical representation of molecules.


Introduction: Integers, Conjugate Pairs, and Eigenvalues of a Graph
The graphs in this paper are simple and connected and all graph properties mentioned will be according to definitions in Harris et al. [1]. There has been much work done in the analysis of eigenvalues of matrices which are adjacency matrices of associated graphs. The following are some examples of these findings, with the references as specified.
(i) There has been interest in classes of graphs whose pairs of eigenvalues satisfy certain conditions. In Sarkar and Mukherjee [2], graphs are considered with reciprocal pairs of eigenvalues ( , 1/ ) whose product is the integer 1. (ii) Pairs of eigenvalues (1, −1), summing to 0, and whose product is −1, are considered in Dias [3]. (iii) Summing the eigenvalues of the adjacency matrix of a graph is connected to the energy of physical structures; see Aimei et al. [4]. (iv) In the paper by van Dam [5], on regular graphs with 4 eigenvalues, he considers the eigenvalue pair of real conjugates ( ± √ )/2 and shows that if a matrix has an eigenvalue ( + √ )/2, then it has an eigenvalue ( − √ )/2 of the same multiplicity, and vice versa. Adding the pair of conjugates ( + √ )/2 and ( − √ )/2, we obtain the integer . Their product is ( 2 − )/4 which is integral, provided the numerator is a multiple of 4. The paper shows that there are graphs whose matrices have conjugate pairs of eigenvalues whose sum does not necessarily sum to the same integer .
The following references show other areas of research which, together with the results on eigenvalues, provide motivation for the new definitions which are contained in this paper.
(i) There has been interest in the importance of pairs of numbers, whose sum and product produce the same integral constant, and this exists outside the linear algebra of matrices; see, for example, Dias [3].
(ii) In Brouwer and Haemers [6], integral trees (where the eigenvalues of trees are integral) are investigated.
2 International Journal of Combinatorics (iii) In the cryptography article, Hamada [7] considers the conjugate code pair consisting of linear codes [ , ] and [ , ] satisfying the constant (integral) sum term + = + , where is the dimension of the vector space involved and is the -digit secret information sent. (iv) In the paper by Kadin [8] he investigates the Cooper pair of opposite wave vectors and − which balance by summing to 0 and whose product is − 2 . (v) Hinch and Leal [9] consider the notion of an isolated particle in the absence of rotary Brownian motion, under the condition that the hydrodynamic and external field couples exactly balance one another. (vi) Armstrong [10] investigates the importance of the quadratic part of a characteristic equation which has the form 2 − + . This quadratic gives rise to the two eigenvalues , = ( ± √ 2 − 4 )/2. The sum and product ( , , resp.) are often referred to as the eigenpair, but we will focus on the pair of eigenvalues ( , ) as the eigen-pair.
Generally, there often exist two eigenvalues (associated with the adjacency matrix of a graph) whose sum or product is integral It is therefore possible to get the same integer when adding or multiplying two distinct, nonzero eigenvalues. This integer is either a fixed constant or a function of an inherent property of the graph, for all graphs belonging to a certain class of graphs. For example, complete graphs on vertices have a pair of eigenvalues with sum of ( ) = − 2 and product of ( ) = 1 − for each ≥ 2, and the complete bipartite graphs /2, /2 on vertices have eigen-pair sum (of nonzero eigenvalues) of 0 and product of − 2 /4. Definition 1 (function ( ) of a member of a class of graphs). We define a function of a member belonging to a class of graphs as a real function ( ) of an inherent property of the member in the class, such as the number of vertices or the clique number of a graph, and so forth.
In this paper, we combine the ideas of a pair of eigenvalues and their balanced integral sum and product with respect to a class of graphs, to introduce a definition which is a form of integral-eigenvalue balance associated with classes of graphs. We investigate classes of graphs on vertices with pairs ( , ) of distinct nonzero eigenvalues such that + = or = , where , are the same integer (resp.) for each graph in the class or the same function for each graph in the class.

Integral Sum Eigen-Pair Balanced Classes of Graphs
Definition 2 (sum * ( ) * eigen-pair (integral) balanced). The class I of connected graphs on elements is said to be sum * ( ) * -pair (integral) balanced if there exists a pair ( , ) of distinct nonzero eigenvalues of the matrices associated with each class of the structures such that + = is the same integer as a fixed constant for each member in the class or is the same integer as a function of each member in the class. The sum balance is exact if is the same integer as a fixed constant for each member in the class, or otherwise it is nonexact.
The following are some examples of such classes of graphs, noting that sum( , ) = + in the examples below.

Cycle Graphs. From Brouwer and Haemers
The 3-cycle (complete graph on 3 vertices) has distinct eigenvalues −1 and 2.
For the 3-, 5-, and 6-cycle, there exist two distinct nonzero eigenvalues whose sum is 1. However, for the 7-cycle, there are no two distinct eigenvalues whose sum is 1. Therefore the class of cycles is not sum(1)eigen-pair balanced as it does not satisfy Definition 2.

Graph Which Is the Join of Two Graphs Whose Adjacency
Matrices Are Both Circulant Matrices. From Lee and Yeh [11], the conjugate eigenvalues of the join of two circulant matrices of graphs are ] + . (7) So the sum of the eigenvalues is so the class of graphs, which are the join of two graphs whose adjacency matrices are circulant, is sum * ( + ) * eigen-pair balanced.

Strongly Regular Graphs.
If a connected regular graph of degree with parameters ( , , ) is strongly regular (i.e., srg(V, , , )), then ( ) has at least 3 different eigenvalues. The eigenvalues are See Spielman [12]. The complement of an srg(V, , , ) is also strongly regular. It is an srg Note that if we ignore the largest eigenvalue of strongly regular graphs, adding the remaining two eigenvalues yields the integer ( − ) so the class of strongly regular graphs with parameters (V, , , ) is nonexact sum * ( − ) * eigenpair balanced; see Godsil and Royle [13] for more information on strongly regular graphs.

Divisible Design Graphs
Definition 3 (divisible design graph). A -regular graph is a divisible design graph if the vertex set can be partitioned into classes of size , such that two distinct vertices from the same class have exactly 1 common neighbours, and two vertices from different classes have exactly 2 common neighbours.
The eigenvalues of divisible design graphs are provided in Haemers [14]; there are 5 distinct eigenvalues. Two of the eigenvalues are so the sum of the eigen-pair is Therefore, the class of divisible design graphs is exact sum * (0) * eigen-pair balanced.

Eigenvalue Pair of Real
Conjugates. The following results are due to van Dam and Haemers [15].
By [ ] and [ ] we denote the rings of polynomials over the integer and rational numbers, respectively.  The characteristic polynomial ( ) ( ) of the adjacency matrix of a graph is monic and has integral coefficients. Using Lemmas 4 and 5 we now obtain the following results. Corollary 6. Every rational eigenvalue of a graph is integral. Corollary 7. If ( + √ )/2 is an irrational eigenvalue of a graph, for some , ∈ , then so is ( − √ )/2, with the same multiplicity, and , ∈ .
Therefore, if the real conjugate pairs are eigenvalues associated with the adjacency matrix of all graphs belonging to a class of graphs, then the class of graphs is sum * ( ) * eigenpair balanced.

Integral Product Eigen-Pair Balanced Classes of Graphs
Definition 8 (product * ( ) * eigen-pair (integral) balanced). A class I of connected graphs on elements is said to be * ( ) * -pair (integral) balanced if there exists a pair of ( , ) of distinct nonzero eigenvalues (counting eigenvalues only once, i.e., ignoring multiplicities) of the matrices associated with each class of the structures such that ( = ) is the same integer as a fixed constant for each member in the class or is the same integer as a function of each member in the class. The product balance is exact if is the same integer as a fixed constant for each member in the class; otherwise it is nonexact.
The following are some examples of such classes of product balanced classes of graphs, discussed above, noting that the product of the pair ( , ) = in the examples below.

Complete Bipartite Graphs. The class of complete bipartite graphs
, on = 2 vertices has as its associated eigenvalues , − , and 0 (as per Section 2.2), so that they are nonexact product * ( − 2 ) * eigen-pair balanced.
The 7-cycle has eigenvalues 2, 1.247, −0.445, and −1.802. No product of two eigenvalues yields an integer! Therefore, the class of cycles is not eigen * ( ) * product balanced for any integer .
However, the class of even cycles is product * ( − 4) * eigenpair balanced, since if = 2 then so that for = 0 we get eigenvalue 2 and for = we get eigenvalue −2, with eigen-pair product −4.

Path Graphs.
Paths graphs on vertices have eigenvalues: From Section 2.4, so that with = 1 and ( = ) the product is which is a function of but is not integral in general.

Graph Which Is the Join of Two Graphs Whose Adjacency
Matrices Are Both Circulant Matrices. The conjugate eigenvalues are So the product of the eigenvalues is so the class of graphs whose adjacency matrix is the join of two graphs whose adjacency matrices are circulant matrices is product * ( − − 2 ( − ) + 2 ) * eigen-pair balanced.
3.6. Wheel Graphs. The wheel graph on vertices, with ( − 1) spokes, has conjugate eigenvalues The product of the conjugate eigenvalues is so the class of cycle wheel graphs is nonexact product * (1 − ) * eigen-pair balanced.

Strongly Regular Graphs.
The conjugate eigen-pair of strongly regular graphs is If we multiply the two conjugate pairs of strongly regular graphs we obtain the integer ( − ), so that the class of strongly regular graphs is nonexact product * ( − ) * eigenpair balanced.

Divisible Design Graphs.
Two of the eigenvalues of a divisible design graph are This class of graphs has eigen-pair product Therefore, the class of divisible design graphs is nonexact product * ( 1 − ) * balanced.

Eigenvalue Pair of Real
Conjugates. The product of the real conjugate pair of eigenvalues ( + √ )/2 and ( − √ )/2 is ( 2 − )/4. This is integral, provided the numerator is a multiple of 4.
Therefore, if the real conjugate pairs are eigenvalues associated with the adjacency matrix of all graphs belonging to a class of graphs, then the class of graphs is product * (( 2 − )/4) * eigen-pair balanced.

Eigen-Bibalanced Classes of Graphs
Definition 9 (eigen-bibalanced classes of graphs). Classes of connected graphs, which are both sum and product eigenpair balanced, are said to be eigen-bibalanced with respect to the eigen-pair ( , ). If this pair is unique to the class, then it is uniquely eigen-bibalanced. For example, the class of complete graphs is uniquely eigen-bibalanced with respect to the eigenpair ( − 1, −1).
The largest eigenvalue occurs in the eigen-pair associated with some classes of graphs discussed above. We observe the following.

Eigen-Bibalanced Classes of Graphs: Criticality, Ratios, Asymptotes, and Area
If a class of connected graphs I are both sum and product eigen-pair balanced with respect to the eigen-pair ( , ), they have been defined above as eigen-bibalanced with respect to ( , ). The class of complete graphs is eigen-bibalanced with the property that the removal of any vertex V from results in a complete graph, which belongs to the same class of complete graphs, which is eigen-bibalanced. The same holds for complete bipartite graphs except for star graphs. Such graphs are said to be stable eigen-bibalanced.
Definition 11 (critically eigen-bibalanced classes of graphs). If belongs to a class I of eigen-bibalanced graphs, and there exists a vertex V of , such that − V belongs to a class I of graphs which is not eigen-bibalanced, we say that I is critically eigen-bibalanced with respect to V.
Wheels on spokes are eigen-bibalanced and the removal of the central vertex results in -cycles, which are not eigenbibalanced. Therefore, the class of wheel graphs is critically eigen-bibalanced with respect to its central vertex. This suggests that the central vertex is essential to the eigenbibalanced characteristic of wheels.
The reciprocals of eigenvalues are connected to the idea of robustness or tightness of graphs, Brouwer and Haemers [7]. Since and are nonzero, the sum of their reciprocals is defined. Therefore we have the following definition.
Definition 12 (eigen-bibalanced ratio of classes of graphs). The importance of ratios in graphs is well researched (see Winter and Adewusi [16]). The eigen-bibalanced ratio of the class of graphs (with respect to the eigen-pairs ( , )) is As and are nonzero, the product is never zero, and so this ratio will always be defined.
Definition 13 (eigen-bibalanced ratio asymptote of classes of graphs). If this ratio is a function ( ) of the order of the graph and has a horizontal asymptote (see Winter and Adewusi [16]), we call this asymptote the eigen-bibalanced ratio asymptote with respect to the eigen-pair ( , ) and is denoted by This asymptote can be seen as describing the behavior of the ratio as the order of the graph becomes increasingly large. The "area" term 2 can be found in the following relation involving spanning trees. Let be the matrix composed of the degrees of in the main diagonal form by adding 1 to each entry of . We then form the shadow number of a graph defined by shad( ) = det( − ), where is the adjacency matrix of . We then have the combinatorial result where ( ) is the number of spanning trees of a connected graph . Also, the number of spanning trees of a connected graph is associated with the Laplacian eigenvalues, ≥ −1 ≥ ⋅ ⋅ ⋅ > 1 = 0, of the graph by the following: This excludes the first Laplacian eigenvalue. Thus, as in the case of the complete graph, the eigenvalue − 1 of the adjacency matrix associated with will not be taken into account when considering spanning trees.
Eigenvalues have been associated with the expansion of graphs (see Hamada [7]), which motivates the idea of areas associated with a class of graphs.
If the eigen-bibalanced ratio of a class of graphs is a function of , then we are able to integrate it with respect to , which leads to the following definition.
Definition 14 (eigen-bibalanced ratio area of classes of graphs). We define the eigen-bibalanced ratio area of the class of graphs with respect to the eigen-pair ( , ) as (see Winter and Adewusi [16]) where is the number of edges and is the number of vertices, and (I) , = 0 when = 0, 1, or 2. Now we define length denoted by , as = 2 / , that is, the average degree of the vertices in , and define height, denoted by , as so (I) , = ⋅ . If there is more than one pair giving rise to such area, then the area of the class is max (I) , for all pairs ( , ). If there is only one eigen-pair associated with the class of graphs that gives rise to the area, then the area is unique.
The height involves binding the sum of the reciprocals of the eigen-pair by its integration and the multiplication of this height by the average degree. This involves one of the most basic, yet important, combinatorial aspects of the graph and results in the term 2 appearing in the eigen-bibalanced ratio area of some classes of graphs.

Examples of Eigen-Bibalanced Classes of Graphs
When we refer to a graph having eigen-pair balanced properties such as sum, product, bibalanced, ratio, and asymptote, we imply that belongs to a class of graphs having such International Journal of Combinatorics 7 eigen-pair properties. We will now look at various examples of eigen-bibalanced classes of graphs.

Complete Graphs.
The complete graph on vertices has the unique eigen-bibalanced ratio of This depends on the order of the graph and has the unique eigen-bibalanced ratio asymptote and eigen-bibalanced ratio area Note that the length of the longest path for the complete graph is − 1, so that in the above expression can be regarded as the height of the graph. Also, the term ln( − 1) occurs as part of the upper bound of the diameter of a graph involving the second largest eigenvalue; see Brouwer and Haemers [6]. Is this area the maximum for all classes of eigen-bibalanced graphs?

Complete Bipartite Graphs. The complete bipartite graph
, on + vertices has the eigen-bibalanced ratio of which is independent of the size of the graph. Its area is This attains its maximum when = = /2, and then the graph (the complete split bipartite graph on vertices) isregular and the area is 6.3. Wheel Graphs. Wheels on vertices, containing ( − 1) spokes and 2( − 1) edges, have eigen-bibalanced ratio This depends on the size of the graph, so they have an eigenbibalanced ratio asymptote of 0 and eigen-bibalanced ratio area of  (45)
Using the pair ( , ) = (−1, 1) we obtain the ratio and using the pair ( , ) = ( √ + 1, − √ + 1) we get Using the class of graphs, where ( + 1) = 2 and eigen-pair ( , ) = ( √ + 1, 1), we have the ratio Therefore the class of star graphs with rays of length 2 does not have a unique eigen-bibalanced ratio. The area with respect to the pair ( , ) = (−1, 1) is and with respect to the pair ( , ) = ( √ + 1, − √ + 1) is International Journal of Combinatorics Since = ( − 1)/2, the areas are, respectively, The greater of the two gives the area of the class of graphs; that is, 6.5. Hypercube Graphs. The -regular hypercube has eigenvalues = ( − 2 ) ( ) , = 0, 1, 2, . . . , , and eigenbibalanced ratio ( fixed, varying, ̸ = 2 , and where, since = 2 , we have = ln / ln 2. Although this is not a good approximation for the area of a hypercube class of graphs, it may suggest that the area of such a class of graphs is greater than that of complete graphs. (62)

Cycle Graphs
Conjecture 15. The only class of regular graphs which are neither sum nor product eigen-pair balanced is cycles.

Eigen-Bibalanced Properties of the Class of Complements of Graphs
Since ∈ I is eigen-bibalanced, then ( + ) and ( ) are constant integers. Therefore, ∈ I is eigen-bibalanced. Therefore, Therefore the class I of graphs is eigen-bibalanced. Functions, which are equal to their own inverse, are called involutions, so that ( ) is an involution. Classes of uniquely eigen-bibalanced graphs whose complements form a class of eigen-bibalanced graphs with an involution property are said to be involution-complementary.

Corollary 19. The involution ( ) = − /( + 1) is a solution of the differential equation
Proof. Since if (−1/2) = 1, then = 1, so In Section 6.6 we showed that −1/2 is the eigenbibalanced ratio asymptote of the class of graphs comprising the join of the complement of the complete graph on 2 vertices and the complete graph on vertices.

Properties of Eigen-Bibalanced Classes of Graphs
Theorem 20. If a class of noncomplete graphs I is eigenbibalanced with respect to the eigen-pair ( , ), ( , ) are conjugate eigen-pairs arising from the quadratic 2 + + , with at least one of , positive and of the form + (with being an integer and being negative), and the ratio ( I ) = ( + )/ is a function of , then is negative and the eigenpair balanced ratio asymptote lies on the interval [−1, 0].
Proof. Let the conjugate eigen-pair ( , ) arise from the roots of the quadratic 2 + + ; that is, Assume > 0, then ≥ 2 √ : ⇒ ≥ 0 and ≥ 0, ⇒ < 0 and < 0, which is a contradiction of the assumption that at least one of , is positive.
Therefore, we have shown that ≤ 0.
We have ≤ − 1 and ≤ − 1 (as these are conjugate eigenvalues of the class of noncomplete graphs I); + = − ; and = − and If = − then the ratio = ( + )/ = 0. However, we are given that ( I ) = ( + )/ is a function of , so we must have ̸ = − . If and are both fixed constants, then the ratio is not a function of , so we cannot have and being both fixed constants.
If = + is a function of , so = −( ) will be a function of . If both and are functions of , then + is ( ) and has ( ) where ≥ . Therefore, asymp( ( I )) = 0. Now let us assume that = + > 0 and = , negative (as per conditions in Theorem 20).
For the complete graph , the quadratic for the complete graph, with eigenvalues (−1, − 1), sum = − 2, and product −( − 1), is So, asymp( (−1 − 1)) = ( − 2)/ − ( − 1) = −1. So the eigen-bibalanced ratio asymptote of the complete graphs is −1, which is the same as one of the eigen-pairs. If a class of graphs is eigen-bibalanced with respect to the pair ( , ) and its asymptote is the same as one of the eigenpairs, then it is said to be asymptotically closed with respect to the pair ( , ). Therefore, the class of complete graphs is asymptotically closed with respect to the pair (−1, − 1).
Theorem 21. The eigen-bibalanced ratio areas of complete bipartite graphs, wheel graphs, and star graphs with rays of length 2 are each bounded above by the area of the complete graph.
As per Section 6.4, the eigen-bibalanced ratio area of the star graph with rays of length 2 is where = ( − 1)/2 and ≥ 3.
(1) Considering the eigen-bibalanced ratio area of the complete graph and the complete split bipartite graph, we get Table 1. Now, for large values of , ( ) −1, −1 = ( −1)( −ln( − 1)) behaves like 2 and is an increasing function of , and So we can conclude that that is, the area of the complete graphs is greater than or equal to the area of the split complete bipartite graph.
(2) Considering the eigen-bibalanced ratio area of the complete graph and the wheel graph for ≥ 3, we get Table 2 So we can conclude that that is, the eigen-bibalanced ratio area of the complete graphs is greater than the area of the wheel graph for ≥ 3. Considering the eigen-bibalanced ratio area of the complete graph and the star graph with rays of length 2, for ≥ 3, we get Table 3. Now, for large values of , ( ) −1, −1 = ( −1)( −ln( − 1)) behaves like 2 and is an increasing function of , and ( 1, 3 ) −√ +1,√ +1 = (2 √ 2( − 1)/ ) √ + 1, where = ( − 1)/2 behaves like 2 √ 2 and is an increasing function of . So we can conclude that where = ( −1)/2; that is, the eigen-bibalanced ratio area of the complete graph is greater than the area of the star graph with rays of length 2, for ≥ 3.
So we can conclude that the eigen-bibalanced areas of complete bipartite graphs, wheel graphs, and star graphs with rays of length 2 are each bounded above by the area of the complete graph.

Theorem 22. If a class of graphs has eigen-bibalanced ratio
then ̸ = 1 and ̸ = 1. Also, if is nonzero, the elements of the eigen-pair ( , ) cannot both be 1/ .   Proof. Let If we let = , we get + = = , so + = , Swopping the roles of and we get the desired result.
The following theorem can be derived from Lee and Yeh [11].

Theorem 23. Define the class of graphs
where is fixed and varies and is greater than 1.
Then this class has eigen-pair with eigen-bibalanced ratio with eigen-bibalanced ratio asymptote and area Proof. From Lee and Yeh [11], the eigenvalue conjugate pair associated with this join is as becomes increasingly large. The eigen-bibalanced ratio area is (with average degree ) With = 1, the area must be that of the complete graph on ( + 1) vertices, which is, as per Section 6.1,  Note that the complement of any ∈ I above is not connected and therefore cannot be eigen-bibalanced as per the definition. Hence the class of graphs ∈ I is not eigen-bibalanced. This result applies for the class of complete graphs, complete bipartite graphs, and wheels and star graphs.

Conjecture 24.
The maximum eigen-bibalanced ratio area of classes of graphs on at least 6 vertices is that of the complete graph and is equal to ( − 1)( − ln( − 1)).
Remark 25. The height = of the complete split bipartite graphis greater than the height = − ln( − 1) of complete graphs. However multiplying by the average degree results in the complete graph having the greater area; that is, A trivial association with spanning trees and areas is given below.

Eigen-Bibalanced Classes of Graphs: Density
Definition 27 (eigen-bibalanced density). The interval [−1, 0] is more convenient if it is a positive interval: we define the eigen-bibalanced density of a class of eigen-bibalanced graphs with asymptote asymp( ( I )) as so that the complete graph has eigen-bibalanced density 1, which we propose as the largest density of all possible eigenbibalanced graphs (the maximum density of a class of graphs will be the largest of its densities over all its possible ratios).

Eigen-Bibalanced Classes of Graphs: Energy and Asymptotes
There is much research on the energy of a graph -it is related to the total -electron energy in a molecule represented by a (molecular) graph (see Adiga et al. [17]).
Definition 29 (energy of a graph). The energy of a graph with adjacency matrix with eigenvalues 1 ≥ 2 ≥ ⋅ ⋅ ⋅ ≥ is See Stevanoviç [18]. If we have a class of eigen-bibalanced graphs, is there a way of determining if the asymptotic ratio has an effect on the energy of a graph? It may be possible by assigning this asymptotic value to the vertices of the graph as, for example, a weight of a loop on a vertex; see Adiga et al. [17]. This suggests the following definition.
In particular, if = 0 the ∞ 0 is the signless Laplacian matrix.

If
= 0, then we get the energy of the signless Laplacian matrix.
As per Section 2.1, the eigenvalues of are ( − 1) 1 , (−1) −1 so that the eigenvalues of ∞ −1 are so that the -asymptotic eigen-bibalanced energy of (with eigen-pair ( , )) is This energy is greater than the normal energy = 2 − 2 of a complete graph on a large number of vertices. This asymptotic energy can be regarded as the eigen-pair balanced energy associated with the graph as the order of becomes increasingly large.

Eigen-Bibalanced Classes of Graphs: Matrix Ratio
Definition 32 (matrix eigen-bibalanced ratio equation). Let be the adjacency matrix of a graph ∈ I, where I is a eigen-bibalanced class of graphs. If the eigenvectors V 1 , V 2 , associated with the eigen-pair ( , ), have unit length, then one has the matrix eigen-bibalanced ratio equation: For example, if I is the class of complete graphs, , then ( ) has eigenvalues − 1 and −1, with eigenvectors of unit length V 1 = 1/√ (1, 1, . . . , 1) and V 2 (which is the unit eigenvector associated with the second eigenvalue of −1); then This is an original definition, and is interesting along with other ratios of matrices which have been defined and investigated over time, for example, the Rayleigh ratio: ( , ) = / , for any (ℎ ℎ) matrix and any (ℎ 1) vector .

Conclusion
In this paper we used the ideas of integral eigenvalues and conjugate eigen-pairs to introduce the new idea of eigen-sum and eigen-product balanced properties of graphs, involving a pair of nonzero distinct eigenvalues and . The fact that these attributes were nonzero, together with the idea of robustness, provided the motivation for the definition of the eigen-bibalanced ratio of classes of graphs, which allowed for the definitions of area and asymptotic ratio of classes of graphs. We found areas and asymptotes of known classes of graphs and it appears that complete graphs have the largest area and the asymptotes of all uniquely eigen-bibalanced classes of graphs may belong to the interval [−1, 0]. Future investigation may also include classes of eigen-bibalanced graphs whose complement class is also eigen-bibalanced.