Results 11 to 20 of about 251,801 (209)
Color Energy Of A Unitary Cayley Graph
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.
Adiga Chandrashekar +2 more
doaj +2 more sources
By given the adjacency matrix, laplacian matrix of a graph we can find the set of eigenvalues of graph in order to discussed about the energy of graph and laplacian energy of graph. (i.e. the sum of eigenvalues of adjacency matrix and laplacian matrix of a graph is called the energy of graph) and the laplacian energy of graph is greater or equal to ...
Najibullah Yousefi +2 more
openaire +3 more sources
The incidence of edges on vertices is a cornerstone of graph theory, with profound implications for various graph properties and applications. Understanding degree distributions and their implications is crucial for analyzing and modeling real-world ...
A. R. Nagalakshmi +3 more
doaj +2 more sources
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 ...
Ebrahim Ghorbani +2 more
openaire +4 more sources
Energy and Randić energy of special graphs
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
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
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
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack H. Koolen, Vincent Moulton
openaire +3 more sources
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 +4 more
doaj +1 more source

