On the signless Laplacian spectral radius of C4-free k-cyclic graphs

Abstract

A k-cyclic graph is a connected graph of order n and size n+k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicyclic, and bicyclic, C4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the (combinatorial) Laplacian.

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…