Maxima of the Q-index for outer-planar graphs
Abstract
The Q-index of graph G is the largest eigenvalue q(G) of its signless Laplacian Q(G). In this paper, we prove that the graph K1∇ Pn-1 has the maximal Q-index among all outer-planar graphs of order n.
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.