Results 181 to 190 of about 251,801 (209)
Some of the next articles are maybe not open access.
On the Laplacian energy of a graph
Czechoslovak Mathematical Journal, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Sombor Index and Graph Energy
MATCH Communications in Mathematical and in Computer Chemistry, 2022Summary: Sombor index is a recently introduced degree based graph topological index. For a graph \(G\), it is defined as \[ SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_u^2+d_v^2}, \] where \(d_u\) denotes the degree of the vertex \(u\) in \(G\). Within a short period of time after introduction of this index by \textit{I. Gutman} [MATCH Commun. Math.
Reja, Mohammed Selim +1 more
openaire +1 more source
Signless Laplacian energy of a graph and energy of a line graph
Linear Algebra and its Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A. Ganie +2 more
openaire +2 more sources
Maximal Energy Bipartite Graphs
Graphs and Combinatorics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack H. Koolen, Vincent Moulton
openaire +3 more sources
Explainable Spatio-Temporal Graph Neural Networks for multi-site photovoltaic energy production [PDF]
In recent years, there has been a growing demand for renewable energy sources, which are inherently associated with a decentralized distribution and dependent on weather conditions. Their management and associated forecasting of produced energy are tasks
Simone Scardapane, Massimo Panella
exaly +2 more sources
ENERGY COMPACTION FILTERS ON GRAPHS
2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018In classical signal processing spectral concentration is an important problem that was first formulated and analyzed by Slepian. The solution to this problem gives the optimal FIR filter that can confine the largest amount of energy in a specific bandwidth for a given filter order. The solution is also known as the prolate sequence.
Teke, Oguzhan, Vaidyanathan, P. P.
openaire +2 more sources
2020
The energy of a graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. The graph energy has close correlation with the total pi-electron energy of molecules calculated with Huckel molecular orbital method in chemistry.
openaire +1 more source
The energy of a graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. The graph energy has close correlation with the total pi-electron energy of molecules calculated with Huckel molecular orbital method in chemistry.
openaire +1 more source
On the Energy of Graphs with Self-loops
Mediterranean Journal of MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rakshith, B. R. +2 more
openaire +1 more source
2018
The energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the eigen values of G. In this paper, we introduce some in-equalities of energy of graphs.
openaire +1 more source
The energy, E(G), of a simple graph G is defined to be the sum of the absolute values of the eigen values of G. In this paper, we introduce some in-equalities of energy of graphs.
openaire +1 more source
2014
The energy of a graph, E(G), is the sum of the absolute values of its eigenvalues. The energy concept has received a high interest over the last decade, at first due to its various applications in chemistry and then in its own right. This paper focuses on some of the most important results on the bounds for the energy of general graphs and the energy ...
openaire +1 more source
The energy of a graph, E(G), is the sum of the absolute values of its eigenvalues. The energy concept has received a high interest over the last decade, at first due to its various applications in chemistry and then in its own right. This paper focuses on some of the most important results on the bounds for the energy of general graphs and the energy ...
openaire +1 more source

