Results 21 to 30 of about 102,073 (256)
AIMS MathematicsBipolar fuzzy sets (BPFs) provide a suitable framework for knowledge representation if some data contains imprecise and ambiguous information. In this manuscript, the lower and upper bounds of the Seidel Laplacian energy of a bipolar fuzzy graph were ...
Sivaranjani Krishnaraj +3 more
doaj +2 more sources
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
Linear and Multilinear Algebra, 2021 In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +2 more sources
On Laplacian resolvent energy of graphs [PDF]
Transactions on Combinatorics, 2023 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
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications
Axioms, 2021 The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad +3 more
doaj +1 more source
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
NORMALIZED LAPLACIAN ENERGY AND NORMALIZED LAPLACIAN-ENERGY-LIKE INVARIANT OF SOME DERIVED GRAPHS
Matematički Vesnik, 2022 Summary: For a connected graph \(G\), the smallest normalized Laplacian eigenvalue is 0 while all others are positive and the largest cannot exceed the value 2. The sum of absolute deviations of the eigenvalues from 1 is called the normalized Laplacian energy, denoted by \(\mathbb{LE}(G)\).
Amin, Ruhul, Abu Nayeem, Sk. Md.
openaire +2 more sources
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
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
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
Bounds for Laplacian-type graph energies [PDF]
Miskolc Mathematical Notes, 2015 © 2015 Miskolc University Press. Let G be an undirected simple and connected graph with n vertices (n ≥ 3) and m edges. Denote by μ1 ≥ μ2 ≥ ... ≥ μn-1 > μn = 0, γ1 ≥ γ2 ≥ ... ≥ γn, and ρ1 ≥ ρ2 ≥ ... ≥ ρn-1 > ρn = 0, respectively, the Laplacian, signless Laplacian, and normalized Laplacian eigenvalues of G.
Gutman, Ivan +2 more
openaire +3 more sources