Results 11 to 20 of about 223,481 (265)
MINIMUM COVERING SEIDEL ENERGY OF A GRAPH [PDF]
In this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs. Upper and lower bounds for minimum covering Seidel energies of agraphs are also established.DOI : http://dx.doi.org/10.22342/jims.22.1.234.71 ...
Rajesh Kanna, M. R. +2 more
openaire +1 more source
On Relationships of Eigenvalue–Based Topological Molecular Descriptors
Three eigenvalue-based topological molecular descriptors are compared using several datasets of alkanes. Two of them are well-known and frequently employed in various QSPR/QSAR investigations, and third-one is a newly derived whose predictive potential ...
Izudin Redžepović, Boris Furtula
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
Laplacian Sum-Eccentricity Energy of a Graph [PDF]
We introduce the Laplacian sum-eccentricity matrix LSe of a graph G, and its Laplacian sum-eccentricity energy LSeE=∑ni=1|ηi|, where ηi=ξi-(2m/n) and where ξ1,ξ2,...,ξn are the eigenvalues of LSe. Upper bounds for LSeE are obtained. A graph is said to be
Biligirirangaiah Sharada +2 more
doaj +1 more source
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs
Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix associated with the graph. In this research work, we find color energy, distance energy, Laplacian energy, and Seidel energy for the Dutch windmill ...
Jing Wu +3 more
doaj +1 more source
Bounds for the Hückel Energy of a Graph [PDF]
Let $G$ be a graph on $n$ vertices with $r := \lfloor n/2 \rfloor$ and let $\lambda _1 \geq\cdots\geq \lambda _{n} $ be adjacency eigenvalues of $G$. Then the Hückel energy of $G$, HE($G$), is defined as $${\rm HE}(G) = \cases{ \displaystyle \; 2\sum_{i=1}^{r} \lambda_i, & \hbox{if $n= 2r$;} \cr \displaystyle \; 2\sum_{i=1}^{\phantom{l}r ...
Ghorbani, E, Koolen, JH, Yang, JY
openaire +4 more sources
The authors introduce the concept of Laplacian energy of a graph \(G\) by letting \(LE(G)=\sum_{i=1}^n | \mu_i - \frac{2m}{n}| \), where \(\mu_i\), \(i=1,\dots,n\), are the eigenvalues of the Laplacian matrix of \(G\). They show that the above definition is well chosen and much in analogy with the usual graph energy \(E(G)\), which is the sum of ...
Gutman, Ivan, Zhou, Bo
openaire +1 more source
The Minimum Edge Covering Energy of a Graph [PDF]
In this paper, we introduce a new kind of graph energy, the minimum edge covering energy, ECE(G). It depends both on the underlying graph G, and on its particular minimum edge covering CE. Upper and lower bounds for ECE(G) are established. The minimum edge covering energy and some of the coefficients of the polynomial of well-known families of graphs ...
Sabeti, Samira +2 more
openaire +1 more source
Time-Dependent Lagrangian Energy Systems on Supermanifolds with Graph Bundles
The aim of this article is firstly to improve time-dependent Lagrangian energy equations using the super jet bundles on supermanifolds. Later, we adapted this study to the graph bundle.
Cansel Aycan, Simge Şimşek
doaj +1 more source
On the spectrum, energy and Laplacian energy of graphs with self-loops
The total energy of a conjugated molecule's π-electrons is a quantum-theoretical feature that has been known since the 1930s. It is determined using the Huckel tight-binding molecular orbital (HMO) method.
Ugasini Preetha P +2 more
doaj +1 more source

