Results 31 to 40 of about 102,073 (256)
(Generalized) Incidence and Laplacian-Like Energies
In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε≠0,1, we found generalized and improved bounds for the sum of ε-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj +1 more source
Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
Abstract Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively.
S. Bhatnagar +2 more
openaire +2 more sources
Local Energy Estimates for the Fractional Laplacian [PDF]
The integral fractional Laplacian of order $s \in (0,1)$ is a nonlocal operator. It is known that solutions to the Dirichlet problem involving such an operator exhibit an algebraic boundary singularity regardless of the domain regularity. This, in turn, deteriorates the global regularity of solutions and as a result the global convergence rate of the ...
Juan Pablo Borthagaray +2 more
openaire +2 more sources
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy [PDF]
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be attained for ...
Helmberg, Christoph, Trevisan, Vilmar
core +3 more sources
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs
Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix associated with the graph. In this research work, we find color energy, distance energy, Laplacian energy, and Seidel energy for the Dutch windmill ...
Jing Wu +3 more
doaj +1 more source
On Energy and Laplacian Energy of Graphs
Let $G=(V,E)$ be a simple graph of order $n$ with $m$ edges. The energy of a graph $G$, denoted by $\mathcal{E}(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. The Laplacian energy of the graph $G$ is defined as \[ LE = LE(G)=\sum^n_{i=1}\left|\mu_i-\frac{2m}{n}\right| \] where $\mu_1,\,\mu_2,\,\ldots,\,\mu_{n-1 ...
Das, Kinkar Ch., Mojalal, Seyed Ahmad
openaire +1 more source
Gevrey smoothing for weak solutions of the fully nonlinear homogeneous Boltzmann and Kac equations without cutoff for Maxwellian molecules [PDF]
It has long been suspected that the non-cutoff Boltzmann operator has similar coercivity properties as a fractional Laplacian. This has led to the hope that the homogenous Boltzmann equation enjoys similar regularity properties as the heat equation with ...
Barbaroux, Jean-Marie +3 more
core +3 more sources
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation
Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan +3 more
wiley +1 more source
Color signless Laplacian energy of graphs
In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj +1 more source

