On the signless Laplacian spectral radius of C4C_{4}-free kk-cyclic graphs

preprint2016arXivOpen access

Abstract

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

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.