The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
Dandan Chen, Xiaoling Ma
openalex +2 more sources
(Distance) signless Laplacian spectral radius of graphs with fixed fractional matching number [PDF]
Chang Caibing, Yan Liu
openalex +1 more source
A Note on the Spectral Radius of Weighted Signless Laplacian Matrix
A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted ...
KAYA GÖK, GÜLİSTAN +2 more
openaire +3 more sources
Distance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs [PDF]
Chang Liu, Jianping Li
openalex +1 more source
The signless Laplacian spectral radius of graphs without intersecting odd cycles [PDF]
Mingzhu Chen +2 more
openalex +1 more source
Some sharp bounds on the distance signless Laplacian spectral radius of graphs [PDF]
Wenxi Hong, Lihua You
openalex +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq 456$.
openaire +2 more sources
Dissecting molecular network structures using a network subgraph approach. [PDF]
Huang CH +5 more
europepmc +1 more source
The Signless Laplacian Spectral Radius for Bicyclic Graphs with κ Pendant Vertices
Lihua Feng
openalex +2 more sources

