Laplacian Sum-Eccentricity Energy of a Graph
Authors
Abstract:
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions for the existence of such graphs are established.
similar resources
On Eccentricity Version of Laplacian Energy of a Graph
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...
full textOn eccentricity version of Laplacian energy of a graph
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and average degree of the vertices of G. Motivated by the work from Sharafdini et al. [R. Sharafdini, H. Panahbar, Vertex weighted...
full textLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
full textlaplacian energy of a fuzzy graph
a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...
full textLaplacian energy of a graph
Let G be a graph with n vertices and m edges. Let λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G, and let μ1, μ2, . . . , μn be the eigenvalues of the Laplacian matrix of G. An earlier much studied quantity E(G) = ∑ni=1 |λi | is the energy of the graph G. We now define and investigate the Laplacian energy as LE(G) = ∑ni=1 |μi − 2m/n|. There is a great deal of analogy between...
full textOn the sum of signless Laplacian eigenvalues of a graph
For a simple graph G, let e(G) denote the number of edges and Sk(G) denote the sum of the k largest eigenvalues of the signless Laplacian matrix of G. We conjecture that for any graph G with n vertices, Sk(G) ≤ e(G) + k+1 2 for k = 1, . . . , n. We prove the conjecture for k = 2 for any graph, and for all k for regular graphs. The conjecture is an analogous to a conjecture by A.E. Brouwer with ...
full textMy Resources
Journal title
volume 2 issue 2
pages 209- 219
publication date 2017-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023