Results 21 to 30 of about 8,535,805 (358)
Total π-electron energy and Laplacian energy: How far the analogy goes? [PDF]
Journal of the Serbian Chemical Society, 2007 The Laplacian energy LE is a newly introduced molecular-graph-based analog of the total π-electron energy E. It is shown that LE and E have a similar structure-dependency only when molecules of different sizes are compared, when a good linear correlation
Radenković Slavko, Gutman Ivan
doaj +3 more sources
McClelland-Type Upper Bounds for Graph Energy
Match-communications in Mathematical and in Computer Chemistry, 2022 Let G be a simple graph of order n, without isolated vertices. An important spectrum–based graph invariant is the graph energy. In this paper, we obtain several new upper bounds of the McClelland type on graph energy and characterize graphs for which ...
I. Milovanovic +3 more
semanticscholar +1 more source
Graph Theory: A Lost Component For Development in Nigeria
Journal of Nigerian Society of Physical Sciences, 2022 Graph theory is one of the neglected branches of mathematics in Nigeria but with the most applications in other fields of research. This article shows the paucity, importance, and necessity of graph theory in the development of Nigeria.
Olayiwola Babarinsa
doaj +1 more source
Estimating the total π-electron energy [PDF]
Journal of the Serbian Chemical Society, 2013 The paper gives a short survey of the most important lower and upper bounds for total π-electron energy, i.e., graph energy (E). In addition, a new lower and a new upper bound for E are deduced, valid for general molecular graphs.
Gutman Ivan, Das Kinkar Ch.
doaj +1 more source
Relating graph energy and Sombor index
Discrete Mathematics Letters, 2021 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
Graph energy and Hadamard's inequality
Match-communications in Mathematical and in Computer Chemistry, 2021 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
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Mathematics, 2023 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
Bicyclic molecular graphs with the greatest energy [PDF]
Journal of the Serbian Chemical Society, 2008 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
Proyecciones (Antofagasta), 2022 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]
International Conference on Learning Representations, 2023 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