Javascript must be enabled to continue!
SPECTRAL BOUNDS FOR LAPLACIAN ENERGY VIA WEIGHTED EIGENVALUE DEVIATIONS
View through CrossRef
In this paper, we study Laplacian energy using a parameterized spectral framework based on deviations of Laplacian eigenvalues from the average degree. The approach introduces a weighting parameter that allows the contributions of individual eigenvalues to be examined more directly.Using this formulation, we derive a partitioned lower bound and a quadratic spectral upper bound, both expressed in terms of Laplacian eigenvalues. The bounds depend on a continuous parameter and a discrete partition index, which are optimized according to the structure of the spectrum.An asymptotic analysis is carried out for representative graph families, showing that the behaviour of the bounds depends on the distribution of the Laplacian eigenvalues. Graphs with concentrated or highly skewed spectra lead to limiting parameter values, while more balanced spectra lead to intermediate values.Numerical results support these observations and show that the parameters reflect how the Laplacian energy is distributed across the spectrum. In this way, the framework also provides information about the underlying spectral structure of the graph, in addition to bounding the energy.
Cerebration Science Publishing Co., Limited
Title: SPECTRAL BOUNDS FOR LAPLACIAN ENERGY VIA WEIGHTED EIGENVALUE DEVIATIONS
Description:
In this paper, we study Laplacian energy using a parameterized spectral framework based on deviations of Laplacian eigenvalues from the average degree.
The approach introduces a weighting parameter that allows the contributions of individual eigenvalues to be examined more directly.
Using this formulation, we derive a partitioned lower bound and a quadratic spectral upper bound, both expressed in terms of Laplacian eigenvalues.
The bounds depend on a continuous parameter and a discrete partition index, which are optimized according to the structure of the spectrum.
An asymptotic analysis is carried out for representative graph families, showing that the behaviour of the bounds depends on the distribution of the Laplacian eigenvalues.
Graphs with concentrated or highly skewed spectra lead to limiting parameter values, while more balanced spectra lead to intermediate values.
Numerical results support these observations and show that the parameters reflect how the Laplacian energy is distributed across the spectrum.
In this way, the framework also provides information about the underlying spectral structure of the graph, in addition to bounding the energy.
Related Results
Spectral analysis of weighted neighborhood networks
Spectral analysis of weighted neighborhood networks
In this paper, we construct an infinite family of weighted growing complex networks, namely, weighted neighborhood networks (WNN) which are constructed in an iterative way by using...
The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formul...
A note on a conjecture for the distance Laplacian matrix
A note on a conjecture for the distance Laplacian matrix
In this note, the graphs of order n having the largest distance Laplacian eigenvalue of multiplicity n â2 are characterized. In particular, it is shown that if the largest eigenv...
A metric deformation and the first eigenvalue of Laplacian on 1-forms
A metric deformation and the first eigenvalue of Laplacian on 1-forms
We search for a higher-dimensional analogue of Calabi’s example of a metric deformation, quoted by Cheeger, which inspired him to prove an inequality between the first eigenvalue o...
AN ASYMPTOTIC EXPANSION OF THE EIGENVALUE COUNTING FUNCTION FOR THE TWISTED BI-LAPLACIAN
AN ASYMPTOTIC EXPANSION OF THE EIGENVALUE COUNTING FUNCTION FOR THE TWISTED BI-LAPLACIAN
We begin the talk with a very brief
recall of the sub-Laplacian on the one-dimensional
Heisenberg group and the related twisted Laplacian. The complete spectral analysis of the twi...
Research of the Fučik spectrum for the (p,q)-Laplacian operator by min-max theory
Research of the Fučik spectrum for the (p,q)-Laplacian operator by min-max theory
The object of research is the Fučik spectrum for the (p,q)-Laplacian operator. In the present paper, we are going to introduce the notion of the Fučik spectrum for a non-linear, no...
Smart Edge Detection Technique in X-ray Images for Improving PSNR using Robert Edge Detection Algorithm with Gaussian Filter in Comparison with Laplacian Algorithm
Smart Edge Detection Technique in X-ray Images for Improving PSNR using Robert Edge Detection Algorithm with Gaussian Filter in Comparison with Laplacian Algorithm
Aim: This study aims to propose smart edge detection techniques in x-ray images for improving PSNR using the Robert edge detection algorithm and compared it with the laplacian algo...
On Laplacian Commutativity of Graphs
On Laplacian Commutativity of Graphs
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs. Two graphs are Laplacian commutative if their Laplacian matrices commute. ...

