Maxima of the signless Laplacian spectral radius for planar graphs

Abstract

The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph K2∇ Pn-2 has the maximal signless Laplacian spectral radius among all planar graphs of order n≥ 456.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…