On Reverse Laplacian Energy of a Graph | Zendy

K. J. Gowtham | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Reverse Laplacian Energy of a Graph

Author(s) -

K. J. Gowtham

Publication year - 2022

Publication title -

letters in applied nanobioscience

Language(s) - English

Resource type - Journals

ISSN - 2284-6808

DOI - 10.33263/lianbs121.019

Subject(s) - laplace operator , combinatorics , laplacian matrix , vertex (graph theory) , mathematics , graph , degree matrix , undirected graph , laplacian smoothing , discrete mathematics , physics , graph power , line graph , mathematical analysis , finite element method , mesh generation , thermodynamics

Let G be a simple undirected graph with n vertices and m edges. The Laplacian matrix L(G) of graph G is defined as L(G)=(l_ij), where (l_ij) is equal to -1 if v_i and v_j are adjacent, 1 if v_i and v_j are not adjacent and d(v_i) if i=j,where d(v_i) is the vertex degree of v_i. This paper defines the reverse Laplacian matrix, reverse Laplacian energy and find the same for some standard graphs. Further, we calculate upper for reverse Laplacian energy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research