Maxima of the signless Laplacian spectral radius for planar graphs

preprint2014arXivOpen access

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−2K_{2}\nabla P_{n-2} has the maximal signless Laplacian spectral radius among all planar graphs of order n≥456n\geq 456.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.