The Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ among all unicyclic graphs on $n$ vertices with a given diameter. All extremal graphs, which have been introduced in our results are also extremal with respect to the signless Laplacian resolvent energy.the formula is not displayed correctly!
-
Increasing the efficiency of the key generation algorithm for NTRU with the help of the norm field
Reza Alimoradi *, Mohammadhossein Noorallahzadeh,
, -
On n-A-con-cos Groups and Determination of some 3-A-con-cos Groups
, Fatemeh Mahmudi
Mathematics Interdisciplinary Research, Winter 2021