Results 51 to 60 of about 11,404 (180)
On the Laplacian eigenvalues of a graph and Laplacian energy
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Pirzada, Hilal A. Ganie
openaire +1 more source
Laplacian and signless laplacian spectra and energies of multi-step wheels
Mathematical Biosciences and Engineering, 2020 <abstract> <p>Energies and spectrum of graphs associated to different linear operators play a significant role in molecular chemistry, polymerisation, pharmacy, computer networking and communication systems. In current article, we compute closed forms of signless Laplacian and Laplacian spectra and energies of multi-step wheel networks < ...
Zheng-Qing Chu +4 more
openaire +4 more sources
Remark on the Laplacian-energy-like and Laplacian incidence energy invariants of graphs [PDF]
Creative Mathematics and Informatics, 2015 Let G be an undirected connected graph with n vertices and m edges, n ≥ 3, and let µ1 ≥ µ2 ≥ · · · ≥ µn−1 > µn = 0 and ρ1 ≥ ρ2 ≥ · · · ≥ ρn−1 > ρn = 0 be Laplacian and normalized Laplacian eigenvalues of G, respectively. The Laplacian-energy-like (LEL) invariant of graph G is defined as... The Laplacian incidence energy of graph is defined as LIE(
I. Z. MILOVANOVIC +3 more
openaire +1 more source
The Laplacian and signless Laplacian energy of a graph under perturbation [PDF]
AIP Conference Proceedings, 2020 In this paper, we find energy, Laplacian energy and signless Laplacian energy of a complete graph when perturbed by adding some vertices and edges.
E. Nandakumar, R. Venkatesan, A. Yasmin
openaire +1 more source
A Laplacian Energy for Document Binarization [PDF]
2011 International Conference on Document Analysis and Recognition, 2011 This paper describes a new algorithm for document binarization, building upon recent work in energy-based segmentation methods. It uses the Laplacian operator to assess the local likelihood of foreground and background labels, Canny edge detection to identify likely discontinuities, and a graph cut implementation to efficiently find the minimum energy ...
openaire +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
Maximality of the signless Laplacian energy
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lucélia Kowalski Pinheiro +1 more
openaire +2 more sources
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Fuzzy Optimization and Modeling, 2022 Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj +1 more source
On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs [PDF]
, 2018 The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance
Abdollah Alhevaz +2 more
core +1 more source
On the second Laplacian spectral moment of a graph [PDF]
, 1984 summary:Kragujevac (M. L. Kragujevac: On the Laplacian energy of a graph, Czech. Math. J. {\it 56}({\it 131}) (2006), 1207--1213) gave the definition of Laplacian energy of a graph $G$ and proved $LE(G)\geq 6n-8$; equality holds if and only if $G=P_n$.
Liu, Ying +3 more
core +1 more source