Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On distance Laplacian spectrum (energy) of graphs
HA Ganie - Discrete Mathematics, Algorithms and Applications, 2020 - World Scientific
For a simple connected graph G of order n having distance Laplacian eigenvalues ρ 1 L≥ ρ
2 L≥⋯≥ ρ n L, the distance Laplacian energy DLE (G) is defined as DLE (G)=∑ i= 1 n| ρ i …
2 L≥⋯≥ ρ n L, the distance Laplacian energy DLE (G) is defined as DLE (G)=∑ i= 1 n| ρ i …
Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph
A Alhevaz, M Baghipur, HA Ganie… - Linear and Multilinear …, 2021 - Taylor & Francis
Let G be a simple connected graph with n vertices, m edges and having distance signless
Laplacian eigenvalues ρ 1≥ ρ 2≥…≥ ρ n≥ 0. For 1≤ k≤ n, let M k (G)=∑ i= 1 k ρ i and N …
Laplacian eigenvalues ρ 1≥ ρ 2≥…≥ ρ n≥ 0. For 1≤ k≤ n, let M k (G)=∑ i= 1 k ρ i and N …
[HTML][HTML] On generalized distance energy of graphs
For the distance matrix D (G) and diagonal matrix of the vertex transmissions T r (G) of a
simple connected graph G, the generalized distance matrix D α (G) is the convex …
simple connected graph G, the generalized distance matrix D α (G) is the convex …
Some inequalities involving the distance signless Laplacian eigenvalues of graphs
Given a simple graph $ G $, the distance signlesss Laplacian $ D^{Q}(G)= Tr (G)+ D (G) $ is
the sum of vertex transmissions matrix $ Tr (G) $ and distance matrix $ D (G) $. In this paper, …
the sum of vertex transmissions matrix $ Tr (G) $ and distance matrix $ D (G) $. In this paper, …
[HTML][HTML] Sharp bounds on (generalized) distance energy of graphs
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 T r (G) be the vertex …
Laplacian matrix, DQ (G) be the distance signless Laplacian matrix, and T r (G) be the vertex …
Merging the spectral theories of distance Estrada and distance signless Laplacian Estrada indices of graphs
Suppose that G is a simple undirected connected graph. Denote by D (G) the distance matrix
of G and by T r (G) the diagonal matrix of the vertex transmissions in G, and let α∈[0, 1]. The …
of G and by T r (G) the diagonal matrix of the vertex transmissions in G, and let α∈[0, 1]. The …
[HTML][HTML] Bounds for the generalized distance eigenvalues of a graph
Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D (G)
be the distance matrix, DL (G) be the distance Laplacian, DQ (G) be the distance signless …
be the distance matrix, DL (G) be the distance Laplacian, DQ (G) be the distance signless …
[HTML][HTML] On generalized distance Gaussian Estrada index of graphs
For a simple undirected connected graph G of order n, let D (G), DL (G), DQ (G) and T r (G)
be, respectively, the distance matrix, the distance Laplacian matrix, the distance signless …
be, respectively, the distance matrix, the distance Laplacian matrix, the distance signless …
The minimum eccentric distance sum of trees with given distance -domination number
L Pei, X Pan - Discrete Mathematics, Algorithms and Applications, 2020 - World Scientific
Let k be a positive integer and G be a simple connected graph. The eccentric distance sum
of G is defined as ξ d (G)=∑ v∈ V (G) 𝜀 G (v) DG (v), where 𝜀 G (v) is the maximum distance …
of G is defined as ξ d (G)=∑ v∈ V (G) 𝜀 G (v) DG (v), where 𝜀 G (v) is the maximum distance …