Results 81 to 90 of about 140 (117)
Predictive potential of distance-related spectral graphical descriptors for structure-property modeling of thermodynamic properties of polycyclic hydrocarbons with applications. [PDF]
Sci RepHayat S, Alanazi SJF, Imran M, Azeem M.
europepmc +1 more source
The Signless Laplacian Spectral Radius of $tK_3$-Free Graphs
The signless Laplacian matrix of a graph $G$ is $Q(G)=D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal degree matrix and the adjacency matrix of $G$, respectively. The signless Laplacian spectral radius of $G$ is the largest eigenvalue of $Q(G)$.
openaire +2 more sources
Spectral energies of redefined Zagreb indices and comparative QSPR applications to anticancer and alcohol datasets. [PDF]
Sci RepZeren Y, Çiçek E, Alsharafi M.
europepmc +1 more source
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ligong Wang, Weige Xi
exaly +2 more sources
Signless Laplacian Spectral Radius and Fractional Matchings in Graphs [PDF]
Discrete Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yingui Pan
exaly +3 more sources
The Signless Laplacian Spectral Radius of Graphs With Given Degree Sequences
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Sharp Bounds for the Signless Laplacian Spectral Radius of Digraphs
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ligong Wang
exaly +4 more sources
On the signless Laplacian spectral radius of weighted digraphs
Discrete Optimization, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weige Xi, Ligong Wang 0001
openaire +1 more source
Discrete Mathematics, Algorithms and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Abdollah Alhevaz +2 more
openaire +2 more sources
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Abdollah Alhevaz +2 more
openaire +2 more sources