Results 31 to 40 of about 252,020 (311)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, Seyed Ahmad Mojallal
openaire +1 more source
Computing the Energy and Estrada Index of Different Molecular Structures
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
On Laplacian resolvent energy of graphs [PDF]
Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\geq d_{
Sandeep Bhatnagar +2 more
doaj +1 more source
On distance Laplacian energy in terms of graph invariants
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A. +3 more
core +1 more source
On the Energy of Unitary Cayley Graphs [PDF]
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
Relating graph energy with vertex-degree-based energies [PDF]
Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj +1 more source
Research and Application of Hypernetwork Energy
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
Skew equienergetic digraphs [PDF]
Let $D$ be a digraph with skew-adjacency matrix $S(D)$. The skew energy of $D$ is defined as the sum of the norms of all eigenvalues of $S(D)$. Two digraphs are said to be skew equienergetic if their skew energies are equal. We establish an
Harishchandra S. Ramane +3 more
doaj
Comparing energy and Randic energy
The recently conceived Randić energy (RE) is examined, and its relation to the (earlier much studied) total π-electron energy (E) is investigated. Within classes of molecular graphs, there exists a relatively good (increasing) linear correlation between ...
Boris Furtula, Ivan Gutman
doaj +1 more source
On Dominating Energy in Bipolar Single-Valued Neutrosophic Graph [PDF]
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

