Bounds on the parameters of non-$L$-borderenergetic graphs

UDC 519.17 We consider graphs such that their Laplacian energy is equivalent to the Laplacian energy of the complete graph of the same order, which is called an $L$-borderenergetic graph. Firstly, we study the graphs with degree sequence consisting of at most three distinct integers and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2023
Hauptverfasser: Dede, Cahit, Maden, Ayşe Dilek
Format: Artikel
Sprache:Englisch
Veröffentlicht: Institute of Mathematics, NAS of Ukraine 2023
Online Zugang:https://umj.imath.kiev.ua/index.php/umj/article/view/7243
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Ukrains’kyi Matematychnyi Zhurnal
Завантажити файл: Pdf

Institution

Ukrains’kyi Matematychnyi Zhurnal
Beschreibung
Zusammenfassung:UDC 519.17 We consider graphs such that their Laplacian energy is equivalent to the Laplacian energy of the complete graph of the same order, which is called an $L$-borderenergetic graph. Firstly, we study the graphs with degree sequence consisting of at most three distinct integers and give new bounds for the number of vertices of these graphs to be non-$L$-borderenergetic. Second, by using Koolen–Moulton and McClelland inequalities, we give new bounds for the number of edges of a non-$L$-borderenergetic graph. Third, we use recent bounds given by Milovanovic, et al. on Laplacian energy to get similar conditions for non-$L$-borderenergetic graphs. Our bounds depend only on the degree sequence of a graph, which is much easier than computing the spectrum of the graph. In other words, we developed a faster approach to exclude non-$L$-borderenergetic graphs.
DOI:10.3842/umzh.v75i9.7243