Results 41 to 50 of about 252,020 (311)
Bounds on graph energy and Randic energy
Discrete Mathematics Letters, 2021 Summary: In the present paper, new lower and upper bounds on energy and Randić energy of non-singular (bipartite) graphs are reported. Additionally, it is shown that the obtained lower bounds are stronger than two previously known lower bounds in the literature.
openaire +3 more sources
More hyperenergetic molecular graphs [PDF]
Journal of the Serbian Chemical Society, 2000 If G is a molecular graph and l1, l2, ..., ln are its eigenvalues, then the energy of G is equal to E(G) = |l1| + |l2| + ... + |ln|. This energy cannot exceed the value . The graph G is said to be hyperenergetic if E(G) >> 2n - 2.
IVAN GUTMAN +3 more
doaj
On Laplacian-energy-like invariant and incidence energy [PDF]
International Journal of Group Theory, 2015 For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj
Mathematical Notes, 2006 In the present paper we introduce Mobius energy for the embedded graphs and formulate its main properties. This energy is invariant under the action of the group generated by all inversions in three-dimensional real space. We study critical configurations for the angles at vertices of degree less than five, and discuss the techniques of construction of
openaire +3 more sources
No Huckel graph is hyperenergetic [PDF]
Journal of the Serbian Chemical Society, 2000 If G is a molecular graph with n vertices and if l1, l2, ..., ln are its eigenvalues, then the energy of G is equal to E(G) = |l1| + |l2|+ ... + |ln|. If E(G) > 2n 2, then G is said to be hyperenergetic.
P. R. HAMPIHOLI +4 more
doaj
, 2021 The discovery of new inorganic materials in unexplored chemical spaces necessitates calculating total energy quickly and with sufficient accuracy.
Vladan, Stevanovic +4 more
core +1 more source
Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures
Entropy, 2018 Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a matrix, one can contemplate graph energy, Randić energy, Laplacian energy ...
Mikołaj Morzy, Tomasz Kajdanowicz
doaj +1 more source
Energy-weighted message passing: an infra-red and collinear safe graph neural network algorithm
, 2022 Hadronic signals of new-physics origin at the Large Hadron Collider can remain hidden within the copiously produced hadronic jets. Unveiling such signatures require highly performant deep-learning algorithms. We construct a class of Graph Neural Networks
Ngairangbam, Vishal S. +2 more
core +1 more source
More Equienergetic Signed Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy.
Harishchandra S. Ramane +1 more
doaj +1 more source
Inversion-based control of electromechanical systems using causal graphical descriptions [PDF]
, 2006 Causal Ordering Graph and Energetic Macroscopic Representation are graphical descriptions to model electromechanical systems using integral causality. Inversion rules have been defined in order to deduce control structure step-bystep from these graphical
F. Giraud +17 more
core +1 more source