Results 21 to 30 of about 6,573,124 (276)
The bounds of the energy and Laplacian energy of chain graphs
AIMS Mathematics, 2021 Let $G$ be a simple connected graph of order $n$ with $m$ edges. The energy $\varepsilon(G)$ of $G$ is the sum of the absolute values of all eigenvalues of the adjacency matrix $A$.
Yinzhen Mei, Chengxiao Guo, Mengtian Liu
doaj +1 more source
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +1 more source
Monophonic Distance Laplacian Energy of Transformation Graphs Sn^++-,Sn^{+-+},Sn^{+++}
Ratio Mathematica, 2023 Let $G$ be a simple connected graph of order $n$, $v_{i}$ its vertex. Let $\delta^{L}_{1}, \delta^{L}_{2}, \ldots, \delta^{L}_{n}$ be the eigenvalues of the distance Laplacian matrix $D^{L}$ of $G$. The distance Laplacian energy is denoted by $LE_{D}(G)$.
Diana R, Binu Selin T
doaj +1 more source
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
MathematicsLet X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina +2 more
doaj +2 more sources
On Reverse Laplacian Energy of a Graph
Letters in Applied NanoBioScience, 2022 Let G be a simple undirected graph with n vertices and m edges. The Laplacian matrix L(G) of graph G is defined as L(G)=(l_ij), where (l_ij) is equal to -1 if v_i and v_j are adjacent, 1 if v_i and v_j are not adjacent and d(v_i) if i=j,where d(v_i) is ...
Gowtham Kalkere Jayanna
semanticscholar +1 more source
The Laplacian Energy of Hesitancy Fuzzy Graphs in Decision-Making Problems
Computer systems science and engineering, 2022 Decision-making (DM) is a process in which several persons concurrently engage, examine the problems, evaluate potential alternatives, and select an appropriate option to the problem.
N. RajagopalReddy +5 more
semanticscholar +1 more source
On Laplacian Equienergetic Signed Graphs
Journal of Mathematics, 2021 The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +1 more source
Sharp Bounds on (Generalized) Distance Energy of Graphs [PDF]
, 2020 Given a simple connected graph G, let D(G) be the distance matrix, DL(G) be the distance Laplacian matrix, DQ(G) be the distance signless Laplacian matrix, and Tr(G) be the vertex transmission diagonal matrix of G.
Alhevaz, Abdollah +3 more
core +1 more source
(Generalized) Incidence and Laplacian-Like Energies
Journal of Mathematics, 2023 In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε≠0,1, we found generalized and improved bounds for the sum of ε-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
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 +3 more
doaj +1 more source