Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
, 2021 Given a simple graph G, the distance signless Laplacian DQ(G) = Tr(G) + D(G) is the sum of vertex transmissions matrix T r(G) and distance matrix D(G). In this paper, thanks to the symmetry of DQ(G), we obtain novel sharp bounds on the distance signless ...
Shang, Yilun +3 more
core +1 more source
On Harary energy and Reciprocal distance Laplacian energies1
Journal of Physics, Conference Series, 2021 Let G be an graph simple, undirected, connected and unweighted graphs. The Reciprocal distance energy of a graph G is equal to the sum of the absolute values of the reciprocal distance eigenvalues.
Macarena Trigo
semanticscholar +1 more source
Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs [PDF]
, 2020 Let $f(D(i, j), d_i, d_j)$ be a real function symmetric in $i$ and $j$ with the property that $f(d, (1+o(1))np, (1+o(1))np)=(1+o(1))f(d, np, np)$ for $d=1,2$.
Xueliang Li, Yiyang Li, Zhiqian Wang
semanticscholar +1 more source
Color laplacian and color signless laplacian energy of complement of subgroup graph of dihedral group [PDF]
, 2020 Laplacian and signless laplacian energy of a finite graph is the most interesting topics on areas of energy of a graph. The new concept of energy of a graph is color energy and furthermore color laplacian and color signless laplacian energy.
Mohammad Jauhari +7 more
core +1 more source
Bounds on the α‐Distance Energy and α‐Distance Estrada Index of Graphs
Discrete Dynamics in Nature and Society, Volume 2020, Issue 1, 2020., 2020 Let G be a simple undirected connected graph, then Dα(G) = αTr(G) + (1 − α)D(G) is called the α‐distance matrix of G, where α ∈ [0,1], D(G) is the distance matrix of G, and Tr(G) is the vertex transmission diagonal matrix of G. In this paper, we study some bounds on the α‐distance energy and α‐distance Estrada index of G.
Yang Yang +3 more
wiley +1 more source
Bounds for the signless Laplacian energy [PDF]
, 2011 The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Martins, Enide A. +9 more
core +1 more source
Signless Laplacian energy of interval-valued fuzzy graph and its applications [PDF]
, 2023 An interval-valued fuzzy graph (IVFG) emanates from a fuzzy graph (FG) where the membership is given in interval form. This framework give the user more flexibility in dealing with fuzzy information.
Al-Quran, Ashraf +4 more
core +1 more source
Color signless Laplacian energy of graphs
, 2017 In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Sabitha D’Souza, Pradeep G. Bhat
core +1 more source
On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
, 2022 Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$.
Pirzada, S., Khan, Saleem
core +1 more source
On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]
, 2013 summary:The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively.
Li, Jianxi, Guo, Ji-Ming, Shiu, Wai Chee
core +1 more source