Results 11 to 20 of about 252,020 (311)
Journal for Research in Applied Sciences and Biotechnology, 2023 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
Oboudi-Type Bounds for Graph Energy [PDF]
Mathematics Interdisciplinary Research, 2019 The graph energy is the sum of absolute values of the eigenvalues of the (0, 1)-adjacency matrix. Oboudi recently obtained lower bounds for graph energy, depending on the largest and smallest graph eigenvalue. In this paper, a few more Oboudi-type bounds
Ivan Gutman
doaj +1 more source
Bounds for the Hückel Energy of a Graph [PDF]
The Electronic Journal of Combinatorics, 2009 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
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
Asymptotic energy of connected cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and lower
Alper Bulut, Ilhan Hacioglu
doaj +1 more source
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs
Journal of Mathematics, 2022 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
Advances in Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack H. Koolen, Vincent Moulton
openaire +3 more sources
On Energy and Laplacian Energy of Graphs
The Electronic Journal of Linear Algebra, 2016 Let $G=(V,E)$ be a simple graph of order $n$ with $m$ edges. The energy of a graph $G$, denoted by $\mathcal{E}(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. The Laplacian energy of the graph $G$ is defined as \[ LE = LE(G)=\sum^n_{i=1}\left|\mu_i-\frac{2m}{n}\right| \] where $\mu_1,\,\mu_2,\,\ldots,\,\mu_{n-1 ...
Das, Kinkar Ch., Mojalal, Seyed Ahmad
openaire +1 more source
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
Node-attribute graph layout for small-world networks [PDF]
, 2011 Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Joe Faith +3 more
core +1 more source