Results 11 to 20 of about 80 (69)
On the Sum of the Powers of Distance Signless Laplacian Eigenvalues of Graphs
Indian Journal of Pure and Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pirzada, S. +3 more
openaire +3 more sources
Mathematics, 2019 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 ] .
Abdollah Alhevaz +2 more
doaj +3 more sources
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian, Fenglei, Wong, Dein, Rou, Jianling
openaire +3 more sources
Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
On Laplacian Equienergetic Signed Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao, Yongqiang Fu
wiley +1 more source
Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph
Complexity, Volume 2021, Issue 1, 2021., 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan +4 more
wiley +1 more source
Variation of sum of two largest eigenvalues of the distance matrices of four-leaf graph
Journal of Hebei University of Science and Technology, 2020 In order to accurately obtain the extremum of the distance eigenvalues of fowr-leaf graphs under tow graph transformations in any case, two graph transformations of four-leaf graphs and the results of the above problems were given by using the properties
Zhe LYU, Yubin GAO
doaj +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
On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings
AIMS Mathematics, 2022 <abstract><p>For a simple connected graph $ G $ of order $ n $, the distance signless Laplacian matrix is defined by $ D^{Q}(G) = D(G) + Tr(G) $, where $ D(G) $ and $ Tr(G) $ is the distance matrix and the diagonal matrix of vertex transmission degrees, respectively. The zero divisor graph $ \Gamma(R) $ of a finite commutative ring $ R $ is
Bilal Ahmad Rather +4 more
openaire +2 more sources
Characterization of extremal graphs from distance signless Laplacian eigenvalues
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Das, Kinkar Ch.
openaire +2 more sources