TOPICS
Search

Signless Laplacian Spectral Radius

The signless Laplacian spectral radius q(G) of a graph G is the largest eigenvalue of its signless Laplacian matrix Q(G)=D(G)+A(G).

Li et al. (2026) study the maximum of q(G) among graphs of fixed edge count that contain a prescribed induced subgraph H. They prove the proposed extremal form when the edge count is at least 3(m(H)-Delta(H))+3, and also when H is a path graph, cycle graph, or complete graph.

See also

Laplacian Spectral Radius, Signless Laplacian Matrix, Spectral Radius

Explore with Wolfram|Alpha

References

Li, W.-J.; Wang, Z.; and Guo, J.-M. "The (Signless) Laplacian Spectral Radius with a Fixed Induced Subgraph of a Graph." Electron. J. Combin. 33, P3.81, 2026. https://doi.org/10.37236/12935.

Cite this as:

Weisstein, Eric W. "Signless Laplacian Spectral Radius." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SignlessLaplacianSpectralRadius.html

Subject classifications