Results 31 to 40 of about 251,801 (209)
Bounds for the Energy of Graphs
Hacettepe Journal of Mathematics and Statistics, 2016 © 2016, Hacettepe University. All rights reserved. The energy of a graph G, denoted by E(G), is the sum of the absolute values of all eigenvalues of G. In this paper we present some lower and upper bounds for E(G) in terms of number of vertices, number of edges, and determinant of the adjacency matrix.
DAS, Kinkar Ch., GUTMAN, İvan
openaire +3 more sources
Computing the Energy and Estrada Index of Different Molecular Structures
Journal of Chemistry, 2022 Graph energy is an invariant that is derived from the spectrum of the adjacency matrix of a graph. Graph energy is actually the absolute sum of all the eigenvalues of the adjacency matrix of a graph i.e.
Zeeshan Saleem Mufti +5 more
doaj +1 more source
Research and Application of Hypernetwork Energy
Jisuanji kexue yu tansuo, 2021 Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
doaj +1 more source
On Dominating Energy in Bipolar Single-Valued Neutrosophic Graph [PDF]
Neutrosophic Sets and Systems, 2023 One of the most important concepts in graph theory for dealing with unpredictable phenomena is the concept of domination and it has gained attention from many scholars.
Siti Nurul Fitriah Mohamad +2 more
doaj +1 more source
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, Seyed Ahmad Mojallal
openaire +1 more source
, 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
On the Energy of Unitary Cayley Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 In this note we obtain the energy of unitary Cayley graph $X_{n}$ which extends a result of R. Balakrishnan for power of a prime and also determine when they are hyperenergetic. We also prove that ${E(X_{n})\over 2(n-1)}\geq{2^{k}\over 4k}$, where $k$ is the number of distinct prime divisors of $n$.
Ramaswamy, H. N., Veena, C. R.
openaire +2 more sources
Remarks on the bounds of graph energy in terms of vertex cover number or matching number [PDF]
, 2021 summary:We give a novel upper bound on graph energy in terms of the vertex cover number, and present a complete characterization of the graphs whose energy equals twice their matching ...
Liu, Xiaoqian, Chen, Xiaodan
core +1 more source
Spectra of the extended neighborhood corona and extended corona of two graphs
Electronic Journal of Graph Theory and Applications, 2016 In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga +2 more
doaj +1 more source
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