Results 21 to 30 of about 9,569,640 (309)
Relating graph energy and Sombor index
The energy of a graph (ε) is the sum of absolute values of its eigenvalues, thus it is a graph-spectrum-based quantity. The Sombor index (SO) is a recently conceived vertex-degree-based topological index.
Alper Ülker +3 more
semanticscholar +1 more source
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix,
Shaun Fallat, Seyed Ahmad Mojallal
doaj +1 more source
Graph energy and Hadamard's inequality
We use Hadamard's determinantal inequality and its generalization to prove some upper bounds on the energy of a graph in terms of degrees, average 2-degrees and number of common neighbors of its vertices.
A. Ghodrati
semanticscholar +1 more source
Bicyclic molecular graphs with the greatest energy [PDF]
The molecular graph Qn is obtained by attaching hexagons to the end vertices of the path graph Pn-12. Earlier empirical studies indicated that Qn has greatest energy among all bicyclic n-vertex (molecular) graphs.
Furtula Boris +2 more
doaj +3 more sources
Energy and Randić energy of special graphs
In this paper, we determine the Randić energy of the m-splitting graph, the m-shadow graph and the m-duplicate graph of a given graph, m being an arbitrary integer. Our results allow the construction of an infinite sequence of graphs having the same Randić energy. Further, we determine some graph invariants like the degree Kirchhoff index, the Kemeny’s
Jahfar, T. K., Chithra, A. V.
openaire +3 more sources
DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion [PDF]
Real-world data generation often involves complex inter-dependencies among instances, violating the IID-data hypothesis of standard learning paradigms and posing a challenge for uncovering the geometric structures for learning desired instance ...
Qitian Wu +5 more
semanticscholar +1 more source
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications
The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad +3 more
doaj +1 more source
The asymptotic value of graph energy for random graphs with degree-based weights [PDF]
In this paper, we investigate the energy of a weighted random graph $G_p(f)$ in $G_{n,p}(f)$, in which each edge $ij$ takes the weight $f(d_i,d_j)$, where $d_v$ is a random variable, the degree of vertex $v$ in the random graph $G_p$ of the Erdos--Renyi ...
Xueliang Li, Yiyang Li, Jiarong Song
semanticscholar +1 more source
Energy-based Out-of-Distribution Detection for Graph Neural Networks [PDF]
Learning on graphs, where instance nodes are inter-connected, has become one of the central problems for deep learning, as relational structures are pervasive and induce data inter-dependence which hinders trivial adaptation of existing approaches that ...
Qitian Wu +3 more
semanticscholar +1 more source
{0,1}-Brauer Configuration Algebras and Their Applications in Graph Energy Theory
The energy E(G) of a graph G is the sum of the absolute values of its adjacency matrix. In contrast, the trace norm of a digraph Q, which is the sum of the singular values of the corresponding adjacency matrix, is the oriented version of the energy of a ...
Natalia Agudelo Muñetón +3 more
doaj +1 more source

