Laplacian energy of certain graphs

Laplacian energy of certain graphs

Let G be a graph with n vertices and m edges. Let [μ.sub.1], [μ.sub.2], ..., [μ.sub.n] be the eigenvalues of the Laplacian matrix of G. The Laplacian energy [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. In this paper, we calculate the exact Laplacian energy of complete graph, complete biparti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2012-03, Vol.1, p.78
Hauptverfasser: Sarasija, P.B, Nageswari, P
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Eigenvalues
Graph theory
Graphs
Laplace transformation
Matrices
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let G be a graph with n vertices and m edges. Let [μ.sub.1], [μ.sub.2], ..., [μ.sub.n] be the eigenvalues of the Laplacian matrix of G. The Laplacian energy [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. In this paper, we calculate the exact Laplacian energy of complete graph, complete bipartite graph, path, cycle and friendship graph. Key Words: Complete graph, complete bipartite graph, path, cycle, friendship graph. AMS(2010): 05C78
ISSN:1937-1055
1937-1047