Results 41 to 50 of about 102,073 (256)
On the construction of L-equienergetic graphs
AKCE International Journal of Graphs and Combinatorics, 2015 For a graph G with n vertices and m edges, and having Laplacian spectrum μ1,μ2,…,μn and signless Laplacian spectrum μ1+,μ2+,…,μn+, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=∑i=1n|μi−2mn| and LE+(G)=∑i=1n ...
S. Pirzada, Hilal A. Ganie
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph .
Qingyun Tao, Yaoping Hou
doaj +1 more source
Laplacian energy of union and Cartesian product and Laplacian equienergetic graphs [PDF]
Kragujevac Journal of Mathematics, 2015 The Laplacian energy of a graph G with n vertices and m edges is defined as LE(G) = ∑ni=1 |μi-2m/n|, where μ1, μ2,...,μn are the Laplacian eigenvalues of G. If two graphs G1 and G2 have equal average vertex degrees, then LE(G1 ∪ G2) = LE(G1) + LE(G2). Otherwise, this identity is violated. We determine a term Ξ, such that LE(G1) + LE(G2) - Ξ ≤LE(G1 ∪ G2)
Ramane H., Gudodagi G., Gutman, Ivan
openaire +2 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source
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
Local convergence of the FEM for the integral fractional Laplacian
, 2020 We provide for first order discretizations of the integral fractional Laplacian sharp local error estimates on proper subdomains in both the local $H^1$-norm and the localized energy norm.
Faustmann, Markus +2 more
core +2 more sources
Characterizing trees with large Laplacian energy
Linear Algebra and its Applications, 2014 We investigate the problem of ordering trees according to their Laplacian energy. More precisely, given a positive integer $n$, we find a class of cardinality approximately $\sqrt{n}$ whose elements are the $n$-vertex trees with largest Laplacian energy.
Fritscher, Eliseu +3 more
openaire +2 more sources
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
Mathematics, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
doaj +1 more source
Point-like perturbed fractional Laplacians through shrinking potentials of finite range
, 2018 We reconstruct the rank-one, singular (point-like) perturbations of the $d$-dimensional fractional Laplacian in the physically meaningful norm-resolvent limit of fractional Schr\"{o}dinger operators with regular potentials centred around the perturbation
Michelangeli, Alessandro +1 more
core +1 more source
Laplacian Sum-Eccentricity Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 We introduce the Laplacian sum-eccentricity matrix LSe of a graph G, and its Laplacian sum-eccentricity energy LSeE=∑ni=1|ηi|, where ηi=ξi-(2m/n) and where ξ1,ξ2,...,ξn are the eigenvalues of LSe. Upper bounds for LSeE are obtained. A graph is said to be
Biligirirangaiah Sharada +2 more
doaj +1 more source