Results 1 to 10 of about 8,773 (222)
On energy, Laplacian energy and $p$-fold graphs
Electronic Journal of Graph Theory and Applications, 2015 For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and ...
Hilal A Ganie +2 more
doaj +4 more sources
The Laplacian-Energy-Like Invariants of Three Types of Lattices [PDF]
Journal of Analytical Methods in Chemistry, 2016 This paper mainly studies the Laplacian-energy-like invariants of the modified hexagonal lattice, modified Union Jack lattice, and honeycomb lattice.
Zheng-Qing Chu, Jia-Bao Liu, Xiao-Xin Li
doaj +2 more sources
Laplacian energy and first Zagreb index of Laplacian integral graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul +2 more
doaj +2 more sources
New bounds for Laplacian energy / Новые ограничения Лапласовой энергии / Nova ograničenja za Laplasovu energiju [PDF]
Vojnotehnički Glasnik, 2020 Introduction/purpose: The Laplacian energy (LE) is the sum of absolute values of the terms μi-2m/n, where μi , i=1,2,…,n, are the eigenvalues of the Laplacian matrix of the graph G with n vertices and m edges. The basic results of the theory of LE are
Ivan Gutman
doaj +2 more sources
On Laplacian-energy-like invariant and incidence energy [PDF]
International Journal of Group Theory, 2015 For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj +2 more sources
On net-Laplacian energy of signed graphs
Communications in Combinatorics and Optimization, 2017 A signed graph is a graph where the edges are assigned either positive or negative signs. Net degree of a signed graph is the difference between the number of positive and negative edges incident with a vertex. It is said to be net-regular if all its
Nutan G. Nayak
doaj +2 more sources
On two energy-like invariants of line graphs and related graph operations
Journal of Inequalities and Applications, 2016 For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
doaj +3 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