Results 41 to 50 of about 80 (69)

Predictive potential of distance-related spectral graphical descriptors for structure-property modeling of thermodynamic properties of polycyclic hydrocarbons with applications. [PDF]

Sci Rep
Hayat S, Alanazi SJF, Imran M, Azeem M.
europepmc   +1 more source

Persistent Mayer Dirac. [PDF]

J Phys Complex
Suwayyid F, Wei GW.
europepmc   +1 more source

On the sum of distance signless Laplacian eigenvalues of graphs

Indian Journal of Pure and Applied Mathematics
Saleem Khan, S. Pirzada, Kinkar Chandra Das   +2 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On eigenvalues of the reciprocal distance signless Laplacian matrix of graphs

Asian-European Journal of Mathematics, 2021
For a simple connected graph [Formula: see text], the reciprocal transmission [Formula: see text] of a vertex [Formula: see text] is defined as [Formula: see text] The reciprocal distance signless Laplacian (briefly RDSL) matrix of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the Harary matrix ...
Abdollah Alhevaz, Maryam Baghipur, Yaser Alizadeh, Shariefuddin Pirzada   +3 more
openaire   +1 more source

Distance signless Laplacian eigenvalues of graphs

Frontiers of Mathematics in China, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Chandra, Lin, Huiqiu, Guo, Jiming   +2 more
openaire   +1 more source

On distance Laplacian and distance signless Laplacian eigenvalues of graphs

Linear and Multilinear Algebra, 2018
Let D(G), DL(G)=Diag(Tr)−D(G) and DQ(G)=Diag(Tr)+D(G) be, respectively, the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix of graph G, where Diag(Tr) deno...
Kinkar Ch. Das, Mustapha Aouchiche, Pierre Hansen   +2 more
openaire   +1 more source

Matching number, connectivity and eigenvalues of distance signless Laplacians

Linear and Multilinear Algebra, 2019
Let G be a connected graph. The first and the second largest distance signless Laplacian eigenvalues of G are denoted by q 1 ( G ) and q 2 ( G ) .
Shuchao Li, Wanting Sun
openaire   +1 more source

Bounds for peripheral distance signless Laplacian eigenvalues of graphs

Asian-European Journal of Mathematics, 2019
The eccentricity of a vertex [Formula: see text] in a graph [Formula: see text] is the maximum distance between [Formula: see text] and any other vertex of [Formula: see text] A vertex with maximum eccentricity is called a peripheral vertex. In this paper, we study the distance signless Laplacian matrix of a connected graph [Formula: see text] with ...
Alhevaz, Abdollah, Baghipur, Maryam, Paul, Somnath, Ramane, H. S.   +3 more
openaire   +1 more source

On the multiplicity of distance signless Laplacian eigenvalues of graphs

Linear and Multilinear Algebra, 2019
In this paper, we characterize all connected graphs, which have a distance signless Laplacian eigenvalue with multiplicity at least n − 2.
Jie Xue, Shuting Liu, Jinlong Shu
openaire   +1 more source

On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity

Linear and Multilinear Algebra, 2017
AbstractDenote by (resp. ) the distance (resp. distance signless Laplacian) eigenvalues of a connected graph G on n vertices, and by (resp. ) the multiplicity of (resp. ). In this paper, we completely determine the graphs with and , respectively.
Lu Lu, Qiongxiang Huang, Xueyi Huang
openaire   +1 more source